./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-054.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:32,128 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:32,216 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f3aa90-4a57-4692-8f11-c8960e3dca25/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:32,221 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:32,221 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:32,242 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:32,243 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:32,243 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:32,243 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:32,243 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:32,244 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:32,244 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:32,244 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:32,244 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:32,245 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:32,246 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:32,246 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:32,246 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:32,246 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:32,246 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:32,246 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:32,246 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:32,246 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:32,246 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:32,246 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:32,247 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:32,247 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:32,559 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:32,569 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:32,572 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:32,575 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:32,575 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:32,576 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f3aa90-4a57-4692-8f11-c8960e3dca25/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-054.smt2
[2025-04-28 21:21:32,577 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:32,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:32,770 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9f3aa90-4a57-4692-8f11-c8960e3dca25/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-054.smt2
[2025-04-28 21:21:32,774 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:32,775 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:32,776 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:32,776 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:32,776 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:32,779 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,817 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32 Unit
[2025-04-28 21:21:32,819 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:32,820 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:32,821 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:32,821 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:32,836 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,836 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,857 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,858 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,860 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,861 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,863 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,868 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,869 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,881 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:32,882 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:32,882 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:32,882 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:32,884 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,886 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:32,900 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:32,914 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:32,918 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:32,938 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:32,938 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:32,939 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:32,939 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure state given in one single declaration
[2025-04-28 21:21:32,939 INFO  L130     BoogieDeclarations]: Found specification of procedure state
[2025-04-28 21:21:32,939 INFO  L138     BoogieDeclarations]: Found implementation of procedure state
[2025-04-28 21:21:32,940 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:32,940 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:32,940 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:33,023 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:33,026 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:33,188 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:33,189 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:33,202 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:33,204 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:33,205 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:33 BoogieIcfgContainer
[2025-04-28 21:21:33,205 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:33,207 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:33,209 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:33,213 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:33,213 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:32" (1/3) ...
[2025-04-28 21:21:33,214 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72af1a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:33, skipping insertion in model container
[2025-04-28 21:21:33,214 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (2/3) ...
[2025-04-28 21:21:33,215 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72af1a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:33, skipping insertion in model container
[2025-04-28 21:21:33,215 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:33" (3/3) ...
[2025-04-28 21:21:33,217 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:33,233 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:33,235 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 3 procedures, 13 locations, 17 edges, 3 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:33,278 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:33,296 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;@8db301, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:33,297 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:33,302 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 13 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 8 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-04-28 21:21:33,313 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:33,313 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,314 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,315 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,321 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,321 INFO  L85        PathProgramCache]: Analyzing trace with hash -597537630, now seen corresponding path program 1 times
[2025-04-28 21:21:33,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,331 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463391389]
[2025-04-28 21:21:33,331 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,332 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,377 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:33,398 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:33,398 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,398 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,618 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:33,620 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,620 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463391389]
[2025-04-28 21:21:33,621 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463391389] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:33,621 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:33,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:33,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031467515]
[2025-04-28 21:21:33,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,629 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:33,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,658 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:33,658 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:33,660 INFO  L87              Difference]: Start difference. First operand  has 13 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 8 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:33,703 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,703 INFO  L93              Difference]: Finished difference Result 13 states and 14 transitions.
[2025-04-28 21:21:33,705 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:33,706 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 9
[2025-04-28 21:21:33,706 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,716 INFO  L225             Difference]: With dead ends: 13
[2025-04-28 21:21:33,716 INFO  L226             Difference]: Without dead ends: 13
[2025-04-28 21:21:33,718 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:33,724 INFO  L437           NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,725 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:33,743 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2025-04-28 21:21:33,766 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13.
[2025-04-28 21:21:33,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:33,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions.
[2025-04-28 21:21:33,772 INFO  L79                 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9
[2025-04-28 21:21:33,772 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,772 INFO  L485      AbstractCegarLoop]: Abstraction has 13 states and 14 transitions.
[2025-04-28 21:21:33,773 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:33,773 INFO  L278                IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions.
[2025-04-28 21:21:33,775 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-04-28 21:21:33,775 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,776 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,776 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:33,776 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,777 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,777 INFO  L85        PathProgramCache]: Analyzing trace with hash 1530833734, now seen corresponding path program 1 times
[2025-04-28 21:21:33,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,777 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886553284]
[2025-04-28 21:21:33,777 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,803 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-04-28 21:21:33,889 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-04-28 21:21:33,889 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,889 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:33,889 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:33,896 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-04-28 21:21:33,920 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-04-28 21:21:33,921 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,921 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:33,973 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:33,974 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:33,975 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:33,981 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:33,989 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1]
[2025-04-28 21:21:34,006 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:34,013 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:34 BoogieIcfgContainer
[2025-04-28 21:21:34,014 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:34,015 INFO  L158              Benchmark]: Toolchain (without parser) took 1240.16ms. Allocated memory is still 234.9MB. Free memory was 158.3MB in the beginning and 197.8MB in the end (delta: -39.6MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:34,016 INFO  L158              Benchmark]: SmtParser took 0.32ms. Allocated memory is still 234.9MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:34,016 INFO  L158              Benchmark]: ChcToBoogie took 43.32ms. Allocated memory is still 234.9MB. Free memory was 158.3MB in the beginning and 156.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:34,017 INFO  L158              Benchmark]: Boogie Preprocessor took 61.61ms. Allocated memory is still 234.9MB. Free memory was 156.7MB in the beginning and 154.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:34,017 INFO  L158              Benchmark]: RCFGBuilder took 323.12ms. Allocated memory is still 234.9MB. Free memory was 154.3MB in the beginning and 143.4MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:34,018 INFO  L158              Benchmark]: TraceAbstraction took 806.87ms. Allocated memory is still 234.9MB. Free memory was 142.6MB in the beginning and 197.8MB in the end (delta: -55.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:34,019 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.32ms. Allocated memory is still 234.9MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 43.32ms. Allocated memory is still 234.9MB. Free memory was 158.3MB in the beginning and 156.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 61.61ms. Allocated memory is still 234.9MB. Free memory was 156.7MB in the beginning and 154.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 323.12ms. Allocated memory is still 234.9MB. Free memory was 154.3MB in the beginning and 143.4MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 806.87ms. Allocated memory is still 234.9MB. Free memory was 142.6MB in the beginning and 197.8MB in the end (delta: -55.3MB). There was no memory consumed. 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_O_1;
      VAL   [hbv_False_O_1=false]
[L0]  CALL  call state(hbv_False_N_2, hbv_False_I_3, hbv_False_J_4, hbv_False_P_5, hbv_False_M_6, hbv_False_G_7, hbv_False_U_8, hbv_False_L_9, hbv_False_H_10, hbv_False_A_11, hbv_False_K_12, hbv_False_T_13, hbv_False_R_14, hbv_False_B_15, hbv_False_D_16, hbv_False_F_17, hbv_False_S_18, hbv_False_Q_19, hbv_False_O_1, hbv_False_C_20, hbv_False_E_21);
      VAL   [hhv_state_A_9=1, hhv_state_B_13=0, hhv_state_C_19=false, hhv_state_D_14=false, hhv_state_E_20=false, hhv_state_F_15=false, hhv_state_G_5=1, hhv_state_H_8=1, hhv_state_I_1=false, hhv_state_J_2=false, hhv_state_K_10=1, hhv_state_L_7=1, hhv_state_M_4=1, hhv_state_N_0=1, hhv_state_O_18=false, hhv_state_P_3=false, hhv_state_Q_17=false, hhv_state_R_12=false, hhv_state_S_16=false, hhv_state_T_11=false, hhv_state_U_6=1]
[L0]        assume ((((((((((((((((((((((((((((((((((((((!((hbv_state_J1_14 || hbv_state_K1_15) && (!hbv_state_J1_14 || !hbv_state_K1_15)) && !((hhv_state_C_19 || hhv_state_J_2) && (!hhv_state_J_2 || !hhv_state_C_19))) && hbv_state_P1_5 == hbv_state_N_11) && !((!hbv_state_F_8 && 2 != hbv_state_B_18) && hbv_state_D_9)) && !((!hbv_state_D_9 || hbv_state_F_8) && hbv_state_H_10 != 1)) && hbv_state_H_10 == hbv_state_A_6) && !(hbv_state_M1_12 && ((hhv_state_K_10 < 0 && !hhv_state_E_20) || (0 <= hhv_state_K_10 && hhv_state_E_20)))) && !((hbv_state_N1_1 || hbv_state_O1_13) && (!hbv_state_O1_13 || !hbv_state_N1_1))) && !((hbv_state_L1_19 || hbv_state_M1_12) && (!hbv_state_M1_12 || !hbv_state_L1_19))) && hhv_state_M_4 == hhv_state_L_7) && hbv_state_M_2 == hbv_state_L_3) && !((!hhv_state_F_15 || !hhv_state_D_14) && hhv_state_U_6 != hhv_state_G_5)) && !((!hhv_state_F_15 && hhv_state_D_14) && hhv_state_H_8 != hhv_state_B_13)) && !(((!hhv_state_E_20 || 0 < hhv_state_K_10 + 10) && (hhv_state_K_10 + 10 <= 0 || hhv_state_E_20)) && !hbv_state_M1_12)) && !((hhv_state_Q_17 || hhv_state_R_12) && (!hhv_state_Q_17 || !hhv_state_R_12))) && !((!hhv_state_F_15 && hhv_state_D_14) && 2 != hhv_state_B_13)) && !((hbv_state_M1_12 || hbv_state_I_16) && (!hbv_state_I_16 || !hbv_state_M1_12))) && !((!hbv_state_D_9 || hbv_state_F_8) && hbv_state_B_18 != 0)) && !((hbv_state_F_8 && hbv_state_D_9) && hbv_state_P1_5 + hbv_state_A_6 != hbv_state_G_7)) && !(((hhv_state_K_10 < 10 || !hhv_state_C_19) && !hbv_state_O1_13) && (hhv_state_C_19 || 10 <= hhv_state_K_10))) && !(hbv_state_P1_5 != hbv_state_G_7 && (!hbv_state_F_8 || !hbv_state_D_9))) && hhv_state_M_4 == hhv_state_G_5) && !((!hbv_state_J_17 || !hbv_state_O1_13) && (hbv_state_O1_13 || hbv_state_J_17))) && hbv_state_L_3 == hhv_state_N_0) && hbv_state_L_3 == hbv_state_K_4) && !((hhv_state_F_15 || !hhv_state_D_14) && hhv_state_H_8 != 1)) && !(((!hhv_state_Q_17 && hbv_state_N1_1) || hhv_state_P_3) && ((!hhv_state_P_3 || !hbv_state_N1_1) || hhv_state_Q_17))) && !((!hhv_state_R_12 || !hhv_state_I_1) && (hhv_state_R_12 || hhv_state_I_1))) && !(((hhv_state_K_10 <= 0 && hhv_state_C_19) || (!hhv_state_C_19 && 0 < hhv_state_K_10)) && hbv_state_O1_13)) && !((hhv_state_P_3 || hhv_state_O_18) && (!hhv_state_P_3 || !hhv_state_O_18))) && !((!hhv_state_E_20 || !hhv_state_I_1) && (hhv_state_E_20 || hhv_state_I_1))) && !((hhv_state_F_15 || !hhv_state_D_14) && hhv_state_B_13 != 0)) && hhv_state_L_7 == hhv_state_K_10) && hhv_state_U_6 == hhv_state_N_0) && !((!hhv_state_J_2 || !hhv_state_T_11) && (hhv_state_T_11 || hhv_state_J_2))) && hbv_state_M_2 == hbv_state_G_7) && !((!hbv_state_F_8 && hbv_state_D_9) && hbv_state_H_10 != hbv_state_B_18)) && hhv_state_H_8 == hhv_state_A_9) && !((hhv_state_T_11 || hhv_state_S_16) && (!hhv_state_T_11 || !hhv_state_S_16))) && !((hhv_state_F_15 && hhv_state_D_14) && hhv_state_A_9 + hhv_state_U_6 != hhv_state_G_5);
      VAL   [hbv_state_A_6=1, hbv_state_B_18=0, hbv_state_D_9=true, hbv_state_F_8=true, hbv_state_G_7=1, hbv_state_H_10=1, hbv_state_I_16=false, hbv_state_J1_14=true, hbv_state_J_17=false, hbv_state_K1_15=true, hbv_state_K_4=1, hbv_state_L1_19=false, hbv_state_L_3=1, hbv_state_M1_12=false, hbv_state_M_2=1, hbv_state_N1_1=false, hbv_state_N_11=0, hbv_state_O1_13=false, hbv_state_P1_5=0, hhv_state_A_9=1, hhv_state_B_13=0, hhv_state_C_19=false, hhv_state_D_14=false, hhv_state_E_20=false, hhv_state_F_15=false, hhv_state_G_5=1, hhv_state_H_8=1, hhv_state_I_1=false, hhv_state_J_2=false, hhv_state_K_10=1, hhv_state_L_7=1, hhv_state_M_4=1, hhv_state_N_0=1, hhv_state_O_18=false, hhv_state_P_3=false, hhv_state_Q_17=false, hhv_state_R_12=false, hhv_state_S_16=false, hhv_state_T_11=false, hhv_state_U_6=1]
[L0]  CALL  call state(hbv_state_N_11, hbv_state_I_16, hbv_state_J_17, hbv_state_K1_15, hbv_state_M_2, hbv_state_G_7, hbv_state_P1_5, hbv_state_L_3, hbv_state_H_10, hbv_state_A_6, hbv_state_K_4, hbv_state_O1_13, hbv_state_M1_12, hbv_state_B_18, hbv_state_D_9, hbv_state_F_8, hbv_state_N1_1, hbv_state_L1_19, hbv_state_J1_14, hbv_state_C_20, hbv_state_E_21);
      VAL   [hhv_state_A_9=1, hhv_state_B_13=0, hhv_state_C_19=false, hhv_state_D_14=true, hhv_state_E_20=true, hhv_state_F_15=true, hhv_state_G_5=1, hhv_state_H_8=1, hhv_state_I_1=false, hhv_state_J_2=false, hhv_state_K_10=1, hhv_state_L_7=1, hhv_state_M_4=1, hhv_state_N_0=0, hhv_state_O_18=true, hhv_state_P_3=true, hhv_state_Q_17=false, hhv_state_R_12=false, hhv_state_S_16=false, hhv_state_T_11=false, hhv_state_U_6=0]
[L0]        assume ((((((((((((((((((!((hhv_state_J_2 || hhv_state_T_11) && (!hhv_state_J_2 || !hhv_state_T_11)) && !((!hhv_state_F_15 && 2 != hhv_state_B_13) && hhv_state_D_14)) && hhv_state_M_4 == hhv_state_L_7) && !((!hhv_state_F_15 && hhv_state_D_14) && hhv_state_H_8 != hhv_state_B_13)) && !hhv_state_I_1) && hhv_state_N_0 == hhv_state_U_6) && hhv_state_M_4 == hhv_state_G_5) && !((!hhv_state_P_3 || !hhv_state_O_18) && (hhv_state_O_18 || hhv_state_P_3))) && hhv_state_N_0 == 0) && !((!hhv_state_R_12 || !hhv_state_Q_17) && (hhv_state_R_12 || hhv_state_Q_17))) && !((!hhv_state_R_12 || !hhv_state_I_1) && (hhv_state_I_1 || hhv_state_R_12))) && hhv_state_L_7 == hhv_state_K_10) && !!hhv_state_P_3) && !((hhv_state_S_16 || hhv_state_T_11) && (!hhv_state_T_11 || !hhv_state_S_16))) && !hhv_state_J_2) && hhv_state_H_8 == hhv_state_A_9) && !((!hhv_state_D_14 || hhv_state_F_15) && hhv_state_H_8 != 1)) && !(hhv_state_G_5 != hhv_state_U_6 && (!hhv_state_F_15 || !hhv_state_D_14))) && !((!hhv_state_D_14 || hhv_state_F_15) && hhv_state_B_13 != 0)) && !((hhv_state_F_15 && hhv_state_D_14) && hhv_state_A_9 + hhv_state_U_6 != hhv_state_G_5);
      VAL   [hhv_state_A_9=1, hhv_state_B_13=0, hhv_state_C_19=false, hhv_state_D_14=true, hhv_state_E_20=true, hhv_state_F_15=true, hhv_state_G_5=1, hhv_state_H_8=1, hhv_state_I_1=false, hhv_state_J_2=false, hhv_state_K_10=1, hhv_state_L_7=1, hhv_state_M_4=1, hhv_state_N_0=0, hhv_state_O_18=true, hhv_state_P_3=true, hhv_state_Q_17=false, hhv_state_R_12=false, hhv_state_S_16=false, hhv_state_T_11=false, hhv_state_U_6=0]
[L0]  RET   call state(hbv_state_N_11, hbv_state_I_16, hbv_state_J_17, hbv_state_K1_15, hbv_state_M_2, hbv_state_G_7, hbv_state_P1_5, hbv_state_L_3, hbv_state_H_10, hbv_state_A_6, hbv_state_K_4, hbv_state_O1_13, hbv_state_M1_12, hbv_state_B_18, hbv_state_D_9, hbv_state_F_8, hbv_state_N1_1, hbv_state_L1_19, hbv_state_J1_14, hbv_state_C_20, hbv_state_E_21);
      VAL   [hbv_state_A_6=1, hbv_state_B_18=0, hbv_state_C_20=false, hbv_state_D_9=true, hbv_state_E_21=true, hbv_state_F_8=true, hbv_state_G_7=1, hbv_state_H_10=1, hbv_state_I_16=false, hbv_state_J1_14=true, hbv_state_J_17=false, hbv_state_K1_15=true, hbv_state_K_4=1, hbv_state_L1_19=false, hbv_state_L_3=1, hbv_state_M1_12=false, hbv_state_M_2=1, hbv_state_N1_1=false, hbv_state_N_11=0, hbv_state_O1_13=false, hbv_state_P1_5=0, hhv_state_A_9=1, hhv_state_B_13=0, hhv_state_C_19=false, hhv_state_D_14=false, hhv_state_E_20=false, hhv_state_F_15=false, hhv_state_G_5=1, hhv_state_H_8=1, hhv_state_I_1=false, hhv_state_J_2=false, hhv_state_K_10=1, hhv_state_L_7=1, hhv_state_M_4=1, hhv_state_N_0=1, hhv_state_O_18=false, hhv_state_P_3=false, hhv_state_Q_17=false, hhv_state_R_12=false, hhv_state_S_16=false, hhv_state_T_11=false, hhv_state_U_6=1]
[L0]  RET   call state(hbv_False_N_2, hbv_False_I_3, hbv_False_J_4, hbv_False_P_5, hbv_False_M_6, hbv_False_G_7, hbv_False_U_8, hbv_False_L_9, hbv_False_H_10, hbv_False_A_11, hbv_False_K_12, hbv_False_T_13, hbv_False_R_14, hbv_False_B_15, hbv_False_D_16, hbv_False_F_17, hbv_False_S_18, hbv_False_Q_19, hbv_False_O_1, hbv_False_C_20, hbv_False_E_21);
      VAL   [hbv_False_A_11=1, hbv_False_B_15=0, hbv_False_C_20=false, hbv_False_D_16=false, hbv_False_E_21=false, hbv_False_F_17=false, hbv_False_G_7=1, hbv_False_H_10=1, hbv_False_I_3=false, hbv_False_J_4=false, hbv_False_K_12=1, hbv_False_L_9=1, hbv_False_M_6=1, hbv_False_N_2=1, hbv_False_O_1=false, hbv_False_P_5=false, hbv_False_Q_19=false, hbv_False_R_14=false, hbv_False_S_18=false, hbv_False_T_13=false, hbv_False_U_8=1]
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 13 locations, 17 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 11 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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:34,036 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
unsat
