./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-177.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:10,266 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:10,343 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f0af0f7-1cdf-455a-999b-4967b8b53e74/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:10,350 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:10,350 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:10,379 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:10,379 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:10,379 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:10,380 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:10,380 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:10,380 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:10,380 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:10,381 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:10,381 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:10,381 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:10,381 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:10,381 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:10,381 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:10,381 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:10,381 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:10,382 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:10,382 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:10,382 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:10,382 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:10,382 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:10,383 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:10,383 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:10,703 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:10,712 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:10,714 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:10,716 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:10,716 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:10,717 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f0af0f7-1cdf-455a-999b-4967b8b53e74/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-177.smt2
[2025-04-28 21:21:10,719 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:10,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:10,993 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f0af0f7-1cdf-455a-999b-4967b8b53e74/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-177.smt2
[2025-04-28 21:21:10,996 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:10,998 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:10,999 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:10,999 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:10,999 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:11,002 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:10" (1/1) ...
[2025-04-28 21:21:11,035 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11 Unit
[2025-04-28 21:21:11,035 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:11,037 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:11,038 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:11,038 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:11,055 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,055 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,079 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,079 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,083 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,084 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,087 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,088 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,089 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,103 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:11,104 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:11,104 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:11,104 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:11,105 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,108 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:11,121 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:11,136 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:11,141 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:11,156 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:11,157 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:11,157 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:11,157 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main given in one single declaration
[2025-04-28 21:21:11,158 INFO  L130     BoogieDeclarations]: Found specification of procedure %main
[2025-04-28 21:21:11,158 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main
[2025-04-28 21:21:11,158 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.6 given in one single declaration
[2025-04-28 21:21:11,158 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.6
[2025-04-28 21:21:11,158 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.6
[2025-04-28 21:21:11,158 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.11 given in one single declaration
[2025-04-28 21:21:11,159 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.11
[2025-04-28 21:21:11,159 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.11
[2025-04-28 21:21:11,159 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.14 given in one single declaration
[2025-04-28 21:21:11,159 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.14
[2025-04-28 21:21:11,159 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.14
[2025-04-28 21:21:11,160 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.19 given in one single declaration
[2025-04-28 21:21:11,160 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.19
[2025-04-28 21:21:11,160 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.19
[2025-04-28 21:21:11,160 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.22 given in one single declaration
[2025-04-28 21:21:11,161 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.22
[2025-04-28 21:21:11,161 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.22
[2025-04-28 21:21:11,161 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.27 given in one single declaration
[2025-04-28 21:21:11,161 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.27
[2025-04-28 21:21:11,161 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.27
[2025-04-28 21:21:11,161 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.28 given in one single declaration
[2025-04-28 21:21:11,162 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.28
[2025-04-28 21:21:11,163 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.28
[2025-04-28 21:21:11,163 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.34 given in one single declaration
[2025-04-28 21:21:11,163 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.34
[2025-04-28 21:21:11,163 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.34
[2025-04-28 21:21:11,163 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.35 given in one single declaration
[2025-04-28 21:21:11,163 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.35
[2025-04-28 21:21:11,163 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.35
[2025-04-28 21:21:11,163 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.41 given in one single declaration
[2025-04-28 21:21:11,163 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.41
[2025-04-28 21:21:11,164 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.41
[2025-04-28 21:21:11,164 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.42 given in one single declaration
[2025-04-28 21:21:11,164 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.42
[2025-04-28 21:21:11,164 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.42
[2025-04-28 21:21:11,164 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.46 given in one single declaration
[2025-04-28 21:21:11,164 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.46
[2025-04-28 21:21:11,164 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.46
[2025-04-28 21:21:11,164 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %assume given in one single declaration
[2025-04-28 21:21:11,164 INFO  L130     BoogieDeclarations]: Found specification of procedure %assume
[2025-04-28 21:21:11,164 INFO  L138     BoogieDeclarations]: Found implementation of procedure %assume
[2025-04-28 21:21:11,166 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %assume.0 given in one single declaration
[2025-04-28 21:21:11,166 INFO  L130     BoogieDeclarations]: Found specification of procedure %assume.0
[2025-04-28 21:21:11,166 INFO  L138     BoogieDeclarations]: Found implementation of procedure %assume.0
[2025-04-28 21:21:11,166 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:11,166 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:11,166 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:11,299 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:11,303 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:11,615 INFO  L?                        ?]: Removed 15 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:11,615 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:11,635 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:11,636 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:11,636 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:11 BoogieIcfgContainer
[2025-04-28 21:21:11,637 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:11,639 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:11,639 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:11,643 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:11,643 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:10" (1/3) ...
[2025-04-28 21:21:11,644 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414fe5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:11, skipping insertion in model container
[2025-04-28 21:21:11,644 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (2/3) ...
[2025-04-28 21:21:11,644 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414fe5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:11, skipping insertion in model container
[2025-04-28 21:21:11,644 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:11" (3/3) ...
[2025-04-28 21:21:11,646 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:11,661 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:11,663 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 17 procedures, 79 locations, 128 edges, 17 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:11,713 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:11,728 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e192a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:11,728 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:11,732 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 79 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 16 states have call predecessors, (27), 27 states have call successors, (27)
[2025-04-28 21:21:11,750 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:11,750 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:11,752 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:11,753 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:11,760 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:11,760 INFO  L85        PathProgramCache]: Analyzing trace with hash 513296537, now seen corresponding path program 1 times
[2025-04-28 21:21:11,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:11,769 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764207584]
[2025-04-28 21:21:11,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:11,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:11,842 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:11,935 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:11,935 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:11,935 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:12,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:12,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:12,436 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764207584]
[2025-04-28 21:21:12,437 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764207584] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:12,437 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:12,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-04-28 21:21:12,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393732530]
[2025-04-28 21:21:12,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:12,447 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:12,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:12,481 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:12,482 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:12,485 INFO  L87              Difference]: Start difference. First operand  has 79 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 16 states have call predecessors, (27), 27 states have call successors, (27) Second operand  has 10 states, 8 states have (on average 4.125) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (16), 8 states have call predecessors, (16), 4 states have call successors, (16)
[2025-04-28 21:21:12,846 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:12,847 INFO  L93              Difference]: Finished difference Result 95 states and 126 transitions.
[2025-04-28 21:21:12,848 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:12,850 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 4.125) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (16), 8 states have call predecessors, (16), 4 states have call successors, (16) Word has length 65
[2025-04-28 21:21:12,850 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:12,918 INFO  L225             Difference]: With dead ends: 95
[2025-04-28 21:21:12,920 INFO  L226             Difference]: Without dead ends: 95
[2025-04-28 21:21:12,923 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:12,929 INFO  L437           NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:12,930 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 896 Invalid, 141 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:12,963 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2025-04-28 21:21:13,023 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89.
[2025-04-28 21:21:13,025 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 50 states have internal predecessors, (51), 27 states have call successors, (27), 16 states have call predecessors, (27), 22 states have return successors, (38), 22 states have call predecessors, (38), 27 states have call successors, (38)
[2025-04-28 21:21:13,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions.
[2025-04-28 21:21:13,057 INFO  L79                 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 65
[2025-04-28 21:21:13,060 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:13,060 INFO  L485      AbstractCegarLoop]: Abstraction has 89 states and 116 transitions.
[2025-04-28 21:21:13,061 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 4.125) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (16), 8 states have call predecessors, (16), 4 states have call successors, (16)
[2025-04-28 21:21:13,065 INFO  L278                IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions.
[2025-04-28 21:21:13,070 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:13,074 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:13,074 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:13,074 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:13,075 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:13,077 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:13,078 INFO  L85        PathProgramCache]: Analyzing trace with hash -714702253, now seen corresponding path program 1 times
[2025-04-28 21:21:13,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:13,083 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322073377]
[2025-04-28 21:21:13,083 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:13,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:13,117 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:13,159 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:13,159 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:13,159 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:13,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:13,518 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:13,518 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322073377]
[2025-04-28 21:21:13,519 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322073377] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:13,519 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:13,519 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-04-28 21:21:13,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639339470]
[2025-04-28 21:21:13,519 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:13,520 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:13,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:13,523 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:13,524 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:13,525 INFO  L87              Difference]: Start difference. First operand 89 states and 116 transitions. Second operand  has 10 states, 8 states have (on average 4.125) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (16), 8 states have call predecessors, (16), 4 states have call successors, (16)
[2025-04-28 21:21:13,764 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:13,764 INFO  L93              Difference]: Finished difference Result 117 states and 156 transitions.
[2025-04-28 21:21:13,764 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:13,765 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 4.125) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (16), 8 states have call predecessors, (16), 4 states have call successors, (16) Word has length 65
[2025-04-28 21:21:13,766 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:13,768 INFO  L225             Difference]: With dead ends: 117
[2025-04-28 21:21:13,772 INFO  L226             Difference]: Without dead ends: 117
[2025-04-28 21:21:13,772 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:13,773 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:13,774 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 792 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:13,775 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2025-04-28 21:21:13,791 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109.
[2025-04-28 21:21:13,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 109 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 60 states have internal predecessors, (61), 27 states have call successors, (27), 16 states have call predecessors, (27), 32 states have return successors, (56), 32 states have call predecessors, (56), 27 states have call successors, (56)
[2025-04-28 21:21:13,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 144 transitions.
[2025-04-28 21:21:13,799 INFO  L79                 Accepts]: Start accepts. Automaton has 109 states and 144 transitions. Word has length 65
[2025-04-28 21:21:13,799 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:13,799 INFO  L485      AbstractCegarLoop]: Abstraction has 109 states and 144 transitions.
[2025-04-28 21:21:13,799 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 4.125) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (16), 8 states have call predecessors, (16), 4 states have call successors, (16)
[2025-04-28 21:21:13,799 INFO  L278                IsEmpty]: Start isEmpty. Operand 109 states and 144 transitions.
[2025-04-28 21:21:13,805 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:13,806 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:13,806 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:13,806 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:13,806 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:13,806 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:13,807 INFO  L85        PathProgramCache]: Analyzing trace with hash -1328089482, now seen corresponding path program 1 times
[2025-04-28 21:21:13,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:13,807 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612296326]
[2025-04-28 21:21:13,807 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:13,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:13,828 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:13,860 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:13,860 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:13,860 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:13,860 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:13,874 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:13,899 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:13,900 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:13,900 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:13,936 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:13,937 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:13,938 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:13,943 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:13,950 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2025-04-28 21:21:13,983 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:13,986 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:13 BoogieIcfgContainer
[2025-04-28 21:21:13,986 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:13,988 INFO  L158              Benchmark]: Toolchain (without parser) took 2989.35ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 158.7MB in the beginning and 80.9MB in the end (delta: 77.8MB). Peak memory consumption was 35.7MB. Max. memory is 33.6GB.
[2025-04-28 21:21:13,988 INFO  L158              Benchmark]: SmtParser took 0.36ms. Allocated memory is still 234.9MB. Free memory is still 171.4MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:13,988 INFO  L158              Benchmark]: ChcToBoogie took 36.99ms. Allocated memory is still 234.9MB. Free memory was 158.7MB in the beginning and 157.9MB in the end (delta: 783.2kB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:13,989 INFO  L158              Benchmark]: Boogie Preprocessor took 65.60ms. Allocated memory is still 234.9MB. Free memory was 157.9MB in the beginning and 155.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:13,989 INFO  L158              Benchmark]: RCFGBuilder took 532.99ms. Allocated memory is still 234.9MB. Free memory was 155.5MB in the beginning and 139.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:13,989 INFO  L158              Benchmark]: TraceAbstraction took 2347.59ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 139.0MB in the beginning and 80.9MB in the end (delta: 58.1MB). Peak memory consumption was 18.9MB. Max. memory is 33.6GB.
[2025-04-28 21:21:13,991 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.36ms. Allocated memory is still 234.9MB. Free memory is still 171.4MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 36.99ms. Allocated memory is still 234.9MB. Free memory was 158.7MB in the beginning and 157.9MB in the end (delta: 783.2kB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 65.60ms. Allocated memory is still 234.9MB. Free memory was 157.9MB in the beginning and 155.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 532.99ms. Allocated memory is still 234.9MB. Free memory was 155.5MB in the beginning and 139.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 2347.59ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 139.0MB in the beginning and 80.9MB in the end (delta: 58.1MB). Peak memory consumption was 18.9MB. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Unknown line] : the set of constraint Horn clauses is unsatisfiable
    the set of constraint Horn clauses is unsatisfiable
We found a FailurePath: 
[L0]  CALL  call False();
[L0]        assume !!hbv_False_v_0_1;
      VAL   [hbv_False_v_0_1=true]
[L0]  CALL  call %main(hbv_False_v_0_1);
      VAL   [hhv_%main_B_0=true]
[L0]        assume !((hbv_%main_C_1 < 0 || !hbv_%main_A_2) && (0 <= hbv_%main_C_1 || hbv_%main_A_2));
      VAL   [hbv_%main_A_2=true, hbv_%main_C_1=0, hhv_%main_B_0=true]
[L0]  CALL  call %assume(hbv_%main_A_2);
      VAL   [hhv_%assume_B_0=true]
[L0]        assume !(!hhv_%assume_B_0 && !hbv_%assume_A_1) && !(hhv_%assume_B_0 && hbv_%assume_A_1);
      VAL   [hbv_%assume_A_1=false, hhv_%assume_B_0=true]
[L0]  CALL  call %assume.0(hhv_%assume_B_0, hbv_%assume_A_1);
      VAL   [hhv_%assume.0_v_1_1=false]
[L0]        assume !hhv_%assume.0_v_1_1;
      VAL   [hhv_%assume.0_v_1_1=false]
[L0]  RET   call %assume.0(hhv_%assume_B_0, hbv_%assume_A_1);
      VAL   [hbv_%assume_A_1=false, hhv_%assume_B_0=true]
[L0]  RET   call %assume(hbv_%main_A_2);
      VAL   [hbv_%main_A_2=true, hbv_%main_C_1=0, hhv_%main_B_0=true]
[L0]  CALL  call %main.6(hbv_%main_D_3, hbv_%main_E_4, hbv_%main_F_5, hbv_%main_C_1, hbv_%main_G_6, hhv_%main_B_0);
      VAL   [hhv_%main.6_A_0=-1, hhv_%main.6_B_1=-1, hhv_%main.6_C_2=1, hhv_%main.6_D_3=0, hhv_%main.6_E_5=true, hhv_%main.6_v_7_4=true]
[L0]        assume hbv_%main.6_v_6_1 == 1 && !!hhv_%main.6_v_7_4;
      VAL   [hbv_%main.6_v_6_1=1, hhv_%main.6_A_0=-1, hhv_%main.6_B_1=-1, hhv_%main.6_C_2=1, hhv_%main.6_D_3=0, hhv_%main.6_E_5=true, hhv_%main.6_v_7_4=true]
[L0]  CALL  call %main.11(hhv_%main.6_A_0, hhv_%main.6_B_1, hhv_%main.6_C_2, hbv_%main.6_v_6_1, hhv_%main.6_D_3, hbv_%main.6_F_2, hhv_%main.6_E_5);
      VAL   [hhv_%main.11_A_0=-1, hhv_%main.11_B_1=-1, hhv_%main.11_C_2=1, hhv_%main.11_D_3=1, hhv_%main.11_E_4=0, hhv_%main.11_F_6=true, hhv_%main.11_v_7_5=false]
[L0]        assume !hhv_%main.11_v_7_5;
      VAL   [hhv_%main.11_A_0=-1, hhv_%main.11_B_1=-1, hhv_%main.11_C_2=1, hhv_%main.11_D_3=1, hhv_%main.11_E_4=0, hhv_%main.11_F_6=true, hhv_%main.11_v_7_5=false]
[L0]  CALL  call %main.14(hhv_%main.11_A_0, hhv_%main.11_B_1, hhv_%main.11_C_2, hhv_%main.11_D_3, hhv_%main.11_E_4, hbv_%main.11_G_1, hhv_%main.11_F_6);
      VAL   [hhv_%main.14_A_0=-1, hhv_%main.14_B_1=-1, hhv_%main.14_C_2=1, hhv_%main.14_D_3=1, hhv_%main.14_E_4=0, hhv_%main.14_F_6=true, hhv_%main.14_v_8_5=true]
[L0]        assume !!hhv_%main.14_v_8_5 && hbv_%main.14_v_7_1 == 1;
      VAL   [hbv_%main.14_v_7_1=1, hhv_%main.14_A_0=-1, hhv_%main.14_B_1=-1, hhv_%main.14_C_2=1, hhv_%main.14_D_3=1, hhv_%main.14_E_4=0, hhv_%main.14_F_6=true, hhv_%main.14_v_8_5=true]
[L0]  CALL  call %main.19(hhv_%main.14_A_0, hhv_%main.14_B_1, hhv_%main.14_C_2, hhv_%main.14_D_3, hbv_%main.14_v_7_1, hhv_%main.14_E_4, hbv_%main.14_G_2, hhv_%main.14_F_6);
      VAL   [hhv_%main.19_A_0=-1, hhv_%main.19_B_1=-1, hhv_%main.19_C_2=1, hhv_%main.19_D_3=1, hhv_%main.19_E_4=1, hhv_%main.19_F_5=0, hhv_%main.19_G_7=true, hhv_%main.19_v_8_6=false]
[L0]        assume !hhv_%main.19_v_8_6;
      VAL   [hhv_%main.19_A_0=-1, hhv_%main.19_B_1=-1, hhv_%main.19_C_2=1, hhv_%main.19_D_3=1, hhv_%main.19_E_4=1, hhv_%main.19_F_5=0, hhv_%main.19_G_7=true, hhv_%main.19_v_8_6=false]
[L0]  CALL  call %main.22(hhv_%main.19_A_0, hhv_%main.19_B_1, hhv_%main.19_C_2, hhv_%main.19_D_3, hhv_%main.19_E_4, hhv_%main.19_F_5, hbv_%main.19_H_1, hhv_%main.19_G_7);
      VAL   [hhv_%main.22_A_0=-1, hhv_%main.22_B_1=-1, hhv_%main.22_C_2=1, hhv_%main.22_D_3=1, hhv_%main.22_E_4=1, hhv_%main.22_F_5=0, hhv_%main.22_G_7=true, hhv_%main.22_v_9_6=false]
[L0]        assume hbv_%main.22_v_8_1 == 0 && !hhv_%main.22_v_9_6;
      VAL   [hbv_%main.22_v_8_1=0, hhv_%main.22_A_0=-1, hhv_%main.22_B_1=-1, hhv_%main.22_C_2=1, hhv_%main.22_D_3=1, hhv_%main.22_E_4=1, hhv_%main.22_F_5=0, hhv_%main.22_G_7=true, hhv_%main.22_v_9_6=false]
[L0]  CALL  call %main.27(hhv_%main.22_A_0, hhv_%main.22_B_1, hhv_%main.22_C_2, hhv_%main.22_D_3, hhv_%main.22_E_4, hbv_%main.22_v_8_1, hhv_%main.22_F_5, hbv_%main.22_H_2, hhv_%main.22_G_7);
      VAL   [hhv_%main.27_A_0=-1, hhv_%main.27_B_1=-1, hhv_%main.27_C_2=1, hhv_%main.27_D_3=1, hhv_%main.27_E_4=1, hhv_%main.27_F_5=0, hhv_%main.27_G_6=0, hhv_%main.27_H_8=true, hhv_%main.27_v_9_7=false]
[L0]        assume !hhv_%main.27_v_9_7 && hbv_%main.27_v_8_1 == hhv_%main.27_D_3;
      VAL   [hbv_%main.27_v_8_1=1, hhv_%main.27_A_0=-1, hhv_%main.27_B_1=-1, hhv_%main.27_C_2=1, hhv_%main.27_D_3=1, hhv_%main.27_E_4=1, hhv_%main.27_F_5=0, hhv_%main.27_G_6=0, hhv_%main.27_H_8=true, hhv_%main.27_v_9_7=false]
[L0]  CALL  call %main.28(hhv_%main.27_A_0, hhv_%main.27_B_1, hhv_%main.27_C_2, hhv_%main.27_D_3, hhv_%main.27_E_4, hhv_%main.27_F_5, hhv_%main.27_G_6, hbv_%main.27_v_8_1, hhv_%main.27_H_8);
      VAL   [hhv_%main.28_B_0=-1, hhv_%main.28_C_1=-1, hhv_%main.28_D_2=1, hhv_%main.28_E_3=1, hhv_%main.28_F_4=1, hhv_%main.28_G_5=0, hhv_%main.28_H_6=0, hhv_%main.28_I_8=true, hhv_%main.28_v_10_7=1]
[L0]        assume hhv_%main.28_v_10_7 != 0 && hhv_%main.28_B_0 + 1 == hbv_%main.28_A_1;
      VAL   [hbv_%main.28_A_1=0, hhv_%main.28_B_0=-1, hhv_%main.28_C_1=-1, hhv_%main.28_D_2=1, hhv_%main.28_E_3=1, hhv_%main.28_F_4=1, hhv_%main.28_G_5=0, hhv_%main.28_H_6=0, hhv_%main.28_I_8=true, hhv_%main.28_v_10_7=1]
[L0]  CALL  call %main.34(hbv_%main.28_A_1, hhv_%main.28_C_1, hhv_%main.28_D_2, hhv_%main.28_E_3, hhv_%main.28_F_4, hhv_%main.28_G_5, hhv_%main.28_H_6, hbv_%main.28_J_2, hhv_%main.28_I_8);
      VAL   [hhv_%main.34_A_0=0, hhv_%main.34_B_1=-1, hhv_%main.34_C_2=1, hhv_%main.34_D_3=1, hhv_%main.34_E_4=1, hhv_%main.34_F_5=0, hhv_%main.34_G_6=0, hhv_%main.34_H_8=true, hhv_%main.34_v_9_7=false]
[L0]        assume hbv_%main.34_v_8_1 == hhv_%main.34_E_4 && !hhv_%main.34_v_9_7;
      VAL   [hbv_%main.34_v_8_1=1, hhv_%main.34_A_0=0, hhv_%main.34_B_1=-1, hhv_%main.34_C_2=1, hhv_%main.34_D_3=1, hhv_%main.34_E_4=1, hhv_%main.34_F_5=0, hhv_%main.34_G_6=0, hhv_%main.34_H_8=true, hhv_%main.34_v_9_7=false]
[L0]  CALL  call %main.35(hhv_%main.34_A_0, hhv_%main.34_B_1, hhv_%main.34_C_2, hhv_%main.34_D_3, hhv_%main.34_E_4, hhv_%main.34_F_5, hhv_%main.34_G_6, hbv_%main.34_v_8_1, hhv_%main.34_H_8);
      VAL   [hhv_%main.35_B_0=0, hhv_%main.35_C_1=-1, hhv_%main.35_D_2=1, hhv_%main.35_E_3=1, hhv_%main.35_F_4=1, hhv_%main.35_G_5=0, hhv_%main.35_H_6=0, hhv_%main.35_I_8=true, hhv_%main.35_v_10_7=1]
[L0]        assume hhv_%main.35_v_10_7 != 0 && hhv_%main.35_C_1 + 1 == hbv_%main.35_A_1;
      VAL   [hbv_%main.35_A_1=0, hhv_%main.35_B_0=0, hhv_%main.35_C_1=-1, hhv_%main.35_D_2=1, hhv_%main.35_E_3=1, hhv_%main.35_F_4=1, hhv_%main.35_G_5=0, hhv_%main.35_H_6=0, hhv_%main.35_I_8=true, hhv_%main.35_v_10_7=1]
[L0]  CALL  call %main.41(hhv_%main.35_B_0, hbv_%main.35_A_1, hhv_%main.35_D_2, hhv_%main.35_E_3, hhv_%main.35_F_4, hhv_%main.35_G_5, hhv_%main.35_H_6, hbv_%main.35_J_2, hhv_%main.35_I_8);
      VAL   [hhv_%main.41_A_0=0, hhv_%main.41_B_1=0, hhv_%main.41_C_2=1, hhv_%main.41_D_3=1, hhv_%main.41_E_4=1, hhv_%main.41_F_5=0, hhv_%main.41_G_6=0, hhv_%main.41_H_8=true, hhv_%main.41_v_9_7=false]
[L0]        assume !hhv_%main.41_v_9_7 && hbv_%main.41_v_8_1 == hhv_%main.41_F_5;
      VAL   [hbv_%main.41_v_8_1=0, hhv_%main.41_A_0=0, hhv_%main.41_B_1=0, hhv_%main.41_C_2=1, hhv_%main.41_D_3=1, hhv_%main.41_E_4=1, hhv_%main.41_F_5=0, hhv_%main.41_G_6=0, hhv_%main.41_H_8=true, hhv_%main.41_v_9_7=false]
[L0]  CALL  call %main.42(hhv_%main.41_A_0, hhv_%main.41_B_1, hhv_%main.41_C_2, hhv_%main.41_D_3, hhv_%main.41_E_4, hhv_%main.41_F_5, hhv_%main.41_G_6, hbv_%main.41_v_8_1, hhv_%main.41_H_8);
      VAL   [hhv_%main.42_C_0=0, hhv_%main.42_D_1=0, hhv_%main.42_E_2=1, hhv_%main.42_F_3=1, hhv_%main.42_G_4=1, hhv_%main.42_H_5=0, hhv_%main.42_I_6=0, hhv_%main.42_J_8=true, hhv_%main.42_v_10_7=0]
[L0]        assume (hhv_%main.42_v_10_7 == 0 && hbv_%main.42_B_2 + 1 == hhv_%main.42_E_2) && !((0 < hhv_%main.42_I_6 || !hbv_%main.42_A_1) && (hbv_%main.42_A_1 || hhv_%main.42_I_6 <= 0));
      VAL   [hbv_%main.42_A_1=true, hbv_%main.42_B_2=0, hhv_%main.42_C_0=0, hhv_%main.42_D_1=0, hhv_%main.42_E_2=1, hhv_%main.42_F_3=1, hhv_%main.42_G_4=1, hhv_%main.42_H_5=0, hhv_%main.42_I_6=0, hhv_%main.42_J_8=true, hhv_%main.42_v_10_7=0]
[L0]  CALL  call %main.46(hhv_%main.42_C_0, hhv_%main.42_D_1, hbv_%main.42_B_2, hhv_%main.42_F_3, hhv_%main.42_G_4, hhv_%main.42_H_5, hhv_%main.42_I_6, hbv_%main.42_A_1, hhv_%main.42_J_8);
      VAL   [hhv_%main.46_H_8=true, hhv_%main.46_v_8_7=true]
[L0]        assume !!hhv_%main.46_v_8_7 && !!hhv_%main.46_H_8;
      VAL   [hhv_%main.46_H_8=true, hhv_%main.46_v_8_7=true]
[L0]  RET   call %main.46(hhv_%main.42_C_0, hhv_%main.42_D_1, hbv_%main.42_B_2, hhv_%main.42_F_3, hhv_%main.42_G_4, hhv_%main.42_H_5, hhv_%main.42_I_6, hbv_%main.42_A_1, hhv_%main.42_J_8);
      VAL   [hbv_%main.42_A_1=true, hbv_%main.42_B_2=0, hhv_%main.42_C_0=0, hhv_%main.42_D_1=0, hhv_%main.42_E_2=1, hhv_%main.42_F_3=1, hhv_%main.42_G_4=1, hhv_%main.42_H_5=0, hhv_%main.42_I_6=0, hhv_%main.42_J_8=true, hhv_%main.42_v_10_7=0]
[L0]  RET   call %main.42(hhv_%main.41_A_0, hhv_%main.41_B_1, hhv_%main.41_C_2, hhv_%main.41_D_3, hhv_%main.41_E_4, hhv_%main.41_F_5, hhv_%main.41_G_6, hbv_%main.41_v_8_1, hhv_%main.41_H_8);
      VAL   [hbv_%main.41_v_8_1=0, hhv_%main.41_A_0=0, hhv_%main.41_B_1=0, hhv_%main.41_C_2=1, hhv_%main.41_D_3=1, hhv_%main.41_E_4=1, hhv_%main.41_F_5=0, hhv_%main.41_G_6=0, hhv_%main.41_H_8=true, hhv_%main.41_v_9_7=false]
[L0]  RET   call %main.41(hhv_%main.35_B_0, hbv_%main.35_A_1, hhv_%main.35_D_2, hhv_%main.35_E_3, hhv_%main.35_F_4, hhv_%main.35_G_5, hhv_%main.35_H_6, hbv_%main.35_J_2, hhv_%main.35_I_8);
      VAL   [hbv_%main.35_A_1=0, hbv_%main.35_J_2=false, hhv_%main.35_B_0=0, hhv_%main.35_C_1=-1, hhv_%main.35_D_2=1, hhv_%main.35_E_3=1, hhv_%main.35_F_4=1, hhv_%main.35_G_5=0, hhv_%main.35_H_6=0, hhv_%main.35_I_8=true, hhv_%main.35_v_10_7=1]
[L0]  RET   call %main.35(hhv_%main.34_A_0, hhv_%main.34_B_1, hhv_%main.34_C_2, hhv_%main.34_D_3, hhv_%main.34_E_4, hhv_%main.34_F_5, hhv_%main.34_G_6, hbv_%main.34_v_8_1, hhv_%main.34_H_8);
      VAL   [hbv_%main.34_v_8_1=1, hhv_%main.34_A_0=0, hhv_%main.34_B_1=-1, hhv_%main.34_C_2=1, hhv_%main.34_D_3=1, hhv_%main.34_E_4=1, hhv_%main.34_F_5=0, hhv_%main.34_G_6=0, hhv_%main.34_H_8=true, hhv_%main.34_v_9_7=false]
[L0]  RET   call %main.34(hbv_%main.28_A_1, hhv_%main.28_C_1, hhv_%main.28_D_2, hhv_%main.28_E_3, hhv_%main.28_F_4, hhv_%main.28_G_5, hhv_%main.28_H_6, hbv_%main.28_J_2, hhv_%main.28_I_8);
      VAL   [hbv_%main.28_A_1=0, hbv_%main.28_J_2=false, hhv_%main.28_B_0=-1, hhv_%main.28_C_1=-1, hhv_%main.28_D_2=1, hhv_%main.28_E_3=1, hhv_%main.28_F_4=1, hhv_%main.28_G_5=0, hhv_%main.28_H_6=0, hhv_%main.28_I_8=true, hhv_%main.28_v_10_7=1]
[L0]  RET   call %main.28(hhv_%main.27_A_0, hhv_%main.27_B_1, hhv_%main.27_C_2, hhv_%main.27_D_3, hhv_%main.27_E_4, hhv_%main.27_F_5, hhv_%main.27_G_6, hbv_%main.27_v_8_1, hhv_%main.27_H_8);
      VAL   [hbv_%main.27_v_8_1=1, hhv_%main.27_A_0=-1, hhv_%main.27_B_1=-1, hhv_%main.27_C_2=1, hhv_%main.27_D_3=1, hhv_%main.27_E_4=1, hhv_%main.27_F_5=0, hhv_%main.27_G_6=0, hhv_%main.27_H_8=true, hhv_%main.27_v_9_7=false]
[L0]  RET   call %main.27(hhv_%main.22_A_0, hhv_%main.22_B_1, hhv_%main.22_C_2, hhv_%main.22_D_3, hhv_%main.22_E_4, hbv_%main.22_v_8_1, hhv_%main.22_F_5, hbv_%main.22_H_2, hhv_%main.22_G_7);
      VAL   [hbv_%main.22_H_2=false, hbv_%main.22_v_8_1=0, hhv_%main.22_A_0=-1, hhv_%main.22_B_1=-1, hhv_%main.22_C_2=1, hhv_%main.22_D_3=1, hhv_%main.22_E_4=1, hhv_%main.22_F_5=0, hhv_%main.22_G_7=true, hhv_%main.22_v_9_6=false]
[L0]  RET   call %main.22(hhv_%main.19_A_0, hhv_%main.19_B_1, hhv_%main.19_C_2, hhv_%main.19_D_3, hhv_%main.19_E_4, hhv_%main.19_F_5, hbv_%main.19_H_1, hhv_%main.19_G_7);
      VAL   [hbv_%main.19_H_1=false, hhv_%main.19_A_0=-1, hhv_%main.19_B_1=-1, hhv_%main.19_C_2=1, hhv_%main.19_D_3=1, hhv_%main.19_E_4=1, hhv_%main.19_F_5=0, hhv_%main.19_G_7=true, hhv_%main.19_v_8_6=false]
[L0]  RET   call %main.19(hhv_%main.14_A_0, hhv_%main.14_B_1, hhv_%main.14_C_2, hhv_%main.14_D_3, hbv_%main.14_v_7_1, hhv_%main.14_E_4, hbv_%main.14_G_2, hhv_%main.14_F_6);
      VAL   [hbv_%main.14_G_2=false, hbv_%main.14_v_7_1=1, hhv_%main.14_A_0=-1, hhv_%main.14_B_1=-1, hhv_%main.14_C_2=1, hhv_%main.14_D_3=1, hhv_%main.14_E_4=0, hhv_%main.14_F_6=true, hhv_%main.14_v_8_5=true]
[L0]  RET   call %main.14(hhv_%main.11_A_0, hhv_%main.11_B_1, hhv_%main.11_C_2, hhv_%main.11_D_3, hhv_%main.11_E_4, hbv_%main.11_G_1, hhv_%main.11_F_6);
      VAL   [hbv_%main.11_G_1=true, hhv_%main.11_A_0=-1, hhv_%main.11_B_1=-1, hhv_%main.11_C_2=1, hhv_%main.11_D_3=1, hhv_%main.11_E_4=0, hhv_%main.11_F_6=true, hhv_%main.11_v_7_5=false]
[L0]  RET   call %main.11(hhv_%main.6_A_0, hhv_%main.6_B_1, hhv_%main.6_C_2, hbv_%main.6_v_6_1, hhv_%main.6_D_3, hbv_%main.6_F_2, hhv_%main.6_E_5);
      VAL   [hbv_%main.6_F_2=false, hbv_%main.6_v_6_1=1, hhv_%main.6_A_0=-1, hhv_%main.6_B_1=-1, hhv_%main.6_C_2=1, hhv_%main.6_D_3=0, hhv_%main.6_E_5=true, hhv_%main.6_v_7_4=true]
[L0]  RET   call %main.6(hbv_%main_D_3, hbv_%main_E_4, hbv_%main_F_5, hbv_%main_C_1, hbv_%main_G_6, hhv_%main_B_0);
      VAL   [hbv_%main_A_2=true, hbv_%main_C_1=0, hbv_%main_D_3=-1, hbv_%main_E_4=-1, hbv_%main_F_5=1, hbv_%main_G_6=true, hhv_%main_B_0=true]
[L0]  RET   call %main(hbv_False_v_0_1);
      VAL   [hbv_False_v_0_1=true]
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 17 procedures, 79 locations, 128 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 1688 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1495 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 244 IncrementalHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 193 mSDtfsCounter, 244 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=2, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2025-04-28 21:21:14,003 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
unsat
