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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:18,460 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:18,540 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e97fa84-c4b9-41d2-88c3-79fde3d2e238/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:18,546 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:18,546 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:18,570 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:18,571 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:18,571 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:18,571 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:18,572 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:18,572 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:18,572 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:18,572 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:18,573 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:18,573 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:18,573 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:18,573 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:18,573 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:18,573 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:18,574 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:18,574 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:18,574 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:18,574 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:18,574 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:18,574 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:18,575 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:18,575 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:18,936 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:18,948 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:18,951 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:18,953 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:18,955 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:18,956 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e97fa84-c4b9-41d2-88c3-79fde3d2e238/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-215.smt2
[2025-04-28 21:21:18,958 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:18,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:19,276 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e97fa84-c4b9-41d2-88c3-79fde3d2e238/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-215.smt2
[2025-04-28 21:21:19,280 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:19,284 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:19,286 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:19,286 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:19,286 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:19,291 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:19" (1/1) ...
[2025-04-28 21:21:19,329 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:19 Unit
[2025-04-28 21:21:19,329 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:19,330 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:19,331 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:19,331 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:19,350 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:19" (1/1) ...
[2025-04-28 21:21:19,351 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:19" (1/1) ...
[2025-04-28 21:21:19,389 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:19" (1/1) ...
[2025-04-28 21:21:19,389 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:19" (1/1) ...
[2025-04-28 21:21:19,393 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:19" (1/1) ...
[2025-04-28 21:21:19,394 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:19" (1/1) ...
[2025-04-28 21:21:19,403 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:19" (1/1) ...
[2025-04-28 21:21:19,404 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:19" (1/1) ...
[2025-04-28 21:21:19,405 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:19" (1/1) ...
[2025-04-28 21:21:19,429 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:19,430 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:19,430 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:19,430 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:19,431 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:19" (1/1) ...
[2025-04-28 21:21:19,434 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:19,452 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:19,467 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:19,471 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:19,490 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:19,491 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:19,491 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:19,491 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV1 given in one single declaration
[2025-04-28 21:21:19,491 INFO  L130     BoogieDeclarations]: Found specification of procedure INV1
[2025-04-28 21:21:19,491 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV1
[2025-04-28 21:21:19,491 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV2 given in one single declaration
[2025-04-28 21:21:19,491 INFO  L130     BoogieDeclarations]: Found specification of procedure INV2
[2025-04-28 21:21:19,491 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV2
[2025-04-28 21:21:19,492 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV3 given in one single declaration
[2025-04-28 21:21:19,492 INFO  L130     BoogieDeclarations]: Found specification of procedure INV3
[2025-04-28 21:21:19,492 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV3
[2025-04-28 21:21:19,492 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV4 given in one single declaration
[2025-04-28 21:21:19,492 INFO  L130     BoogieDeclarations]: Found specification of procedure INV4
[2025-04-28 21:21:19,492 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV4
[2025-04-28 21:21:19,492 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:19,494 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:19,494 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:19,578 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:19,582 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:19,856 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:19,856 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:19,869 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:19,869 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:19,870 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:19 BoogieIcfgContainer
[2025-04-28 21:21:19,870 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:19,873 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:19,873 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:19,879 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:19,879 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:19" (1/3) ...
[2025-04-28 21:21:19,880 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180d4091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:19, skipping insertion in model container
[2025-04-28 21:21:19,880 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:19" (2/3) ...
[2025-04-28 21:21:19,880 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180d4091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:19, skipping insertion in model container
[2025-04-28 21:21:19,881 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:19" (3/3) ...
[2025-04-28 21:21:19,882 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:19,899 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:19,902 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 6 procedures, 40 locations, 84 edges, 6 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:19,962 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:19,981 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;@7e38a9dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:19,981 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:19,986 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 40 states, 12 states have (on average 1.75) internal successors, (21), 21 states have internal predecessors, (21), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 14 states have call predecessors, (21), 21 states have call successors, (21)
[2025-04-28 21:21:20,003 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:20,003 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:20,004 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:20,005 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:20,013 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:20,014 INFO  L85        PathProgramCache]: Analyzing trace with hash -1640801013, now seen corresponding path program 1 times
[2025-04-28 21:21:20,024 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:20,024 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799948225]
[2025-04-28 21:21:20,024 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:20,025 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:20,068 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:20,088 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:20,088 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:20,089 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:20,253 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:20,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:20,253 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799948225]
[2025-04-28 21:21:20,254 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799948225] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:20,254 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:20,263 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:20,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278753357]
[2025-04-28 21:21:20,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:20,272 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:20,272 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:20,309 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:20,310 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:20,313 INFO  L87              Difference]: Start difference. First operand  has 40 states, 12 states have (on average 1.75) internal successors, (21), 21 states have internal predecessors, (21), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 14 states have call predecessors, (21), 21 states have call successors, (21) 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:20,478 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:20,479 INFO  L93              Difference]: Finished difference Result 40 states and 73 transitions.
[2025-04-28 21:21:20,480 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:20,482 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:20,482 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:20,490 INFO  L225             Difference]: With dead ends: 40
[2025-04-28 21:21:20,490 INFO  L226             Difference]: Without dead ends: 40
[2025-04-28 21:21:20,493 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:20,497 INFO  L437           NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:20,498 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:20,518 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2025-04-28 21:21:20,568 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40.
[2025-04-28 21:21:20,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 20 states have internal predecessors, (20), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (32), 14 states have call predecessors, (32), 21 states have call successors, (32)
[2025-04-28 21:21:20,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions.
[2025-04-28 21:21:20,605 INFO  L79                 Accepts]: Start accepts. Automaton has 40 states and 73 transitions. Word has length 9
[2025-04-28 21:21:20,606 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:20,612 INFO  L485      AbstractCegarLoop]: Abstraction has 40 states and 73 transitions.
[2025-04-28 21:21:20,612 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:20,613 INFO  L278                IsEmpty]: Start isEmpty. Operand 40 states and 73 transitions.
[2025-04-28 21:21:20,619 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:20,619 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:20,620 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:20,620 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:20,620 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:20,621 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:20,621 INFO  L85        PathProgramCache]: Analyzing trace with hash 1894792639, now seen corresponding path program 1 times
[2025-04-28 21:21:20,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:20,622 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527095233]
[2025-04-28 21:21:20,622 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:20,622 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:20,645 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:20,677 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:20,678 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:20,678 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:21,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:21,058 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:21,058 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527095233]
[2025-04-28 21:21:21,058 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527095233] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:21,058 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66607190]
[2025-04-28 21:21:21,059 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:21,059 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:21,065 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:21,071 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:21,073 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:21,141 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:21,195 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:21,195 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:21,195 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:21,199 INFO  L256         TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:21,207 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:21,440 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:21,441 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:21,441 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [66607190] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:21,441 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:21,441 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8
[2025-04-28 21:21:21,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115270568]
[2025-04-28 21:21:21,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:21,445 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:21,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:21,445 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:21,446 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:21,446 INFO  L87              Difference]: Start difference. First operand 40 states and 73 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:21,606 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:21,607 INFO  L93              Difference]: Finished difference Result 42 states and 75 transitions.
[2025-04-28 21:21:21,608 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:21,609 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 21
[2025-04-28 21:21:21,609 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:21,611 INFO  L225             Difference]: With dead ends: 42
[2025-04-28 21:21:21,611 INFO  L226             Difference]: Without dead ends: 42
[2025-04-28 21:21:21,611 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:21,612 INFO  L437           NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:21,614 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 126 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:21,616 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2025-04-28 21:21:21,628 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40.
[2025-04-28 21:21:21,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 20 states have internal predecessors, (20), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (31), 14 states have call predecessors, (31), 21 states have call successors, (31)
[2025-04-28 21:21:21,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 72 transitions.
[2025-04-28 21:21:21,634 INFO  L79                 Accepts]: Start accepts. Automaton has 40 states and 72 transitions. Word has length 21
[2025-04-28 21:21:21,634 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:21,634 INFO  L485      AbstractCegarLoop]: Abstraction has 40 states and 72 transitions.
[2025-04-28 21:21:21,634 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:21,635 INFO  L278                IsEmpty]: Start isEmpty. Operand 40 states and 72 transitions.
[2025-04-28 21:21:21,639 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:21,639 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:21,639 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:21,646 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:21,840 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:21,840 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:21,841 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:21,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -866226369, now seen corresponding path program 1 times
[2025-04-28 21:21:21,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:21,841 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236267126]
[2025-04-28 21:21:21,841 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:21,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:21,854 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:21,872 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:21,873 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:21,873 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:22,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:22,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:22,081 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236267126]
[2025-04-28 21:21:22,081 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236267126] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:22,081 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782707376]
[2025-04-28 21:21:22,081 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:22,082 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:22,086 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:22,088 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:22,092 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:22,140 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:22,173 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:22,174 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:22,174 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:22,177 INFO  L256         TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:22,179 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:22,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:22,328 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:22,328 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782707376] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:22,328 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:22,328 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8
[2025-04-28 21:21:22,328 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38146516]
[2025-04-28 21:21:22,329 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:22,329 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:22,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:22,331 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:22,331 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:22,331 INFO  L87              Difference]: Start difference. First operand 40 states and 72 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:22,474 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:22,474 INFO  L93              Difference]: Finished difference Result 40 states and 71 transitions.
[2025-04-28 21:21:22,477 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:22,477 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 21
[2025-04-28 21:21:22,478 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:22,479 INFO  L225             Difference]: With dead ends: 40
[2025-04-28 21:21:22,479 INFO  L226             Difference]: Without dead ends: 40
[2025-04-28 21:21:22,479 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:22,480 INFO  L437           NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:22,480 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 127 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:22,481 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2025-04-28 21:21:22,491 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40.
[2025-04-28 21:21:22,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 20 states have internal predecessors, (20), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (30), 14 states have call predecessors, (30), 21 states have call successors, (30)
[2025-04-28 21:21:22,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 71 transitions.
[2025-04-28 21:21:22,497 INFO  L79                 Accepts]: Start accepts. Automaton has 40 states and 71 transitions. Word has length 21
[2025-04-28 21:21:22,497 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:22,497 INFO  L485      AbstractCegarLoop]: Abstraction has 40 states and 71 transitions.
[2025-04-28 21:21:22,498 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:22,498 INFO  L278                IsEmpty]: Start isEmpty. Operand 40 states and 71 transitions.
[2025-04-28 21:21:22,499 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:22,500 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:22,501 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:22,506 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:22,701 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:22,701 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:22,702 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:22,702 INFO  L85        PathProgramCache]: Analyzing trace with hash -496736983, now seen corresponding path program 1 times
[2025-04-28 21:21:22,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:22,702 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886782002]
[2025-04-28 21:21:22,702 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:22,702 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:22,709 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:22,726 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:22,726 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:22,726 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:22,726 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:22,733 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:22,747 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:22,750 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:22,750 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:22,772 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:22,772 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:22,773 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:22,776 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:22,780 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2025-04-28 21:21:22,799 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:22,807 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:22 BoogieIcfgContainer
[2025-04-28 21:21:22,807 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:22,808 INFO  L158              Benchmark]: Toolchain (without parser) took 3526.10ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 161.7MB in the beginning and 75.6MB in the end (delta: 86.1MB). Peak memory consumption was 20.2MB. Max. memory is 33.6GB.
[2025-04-28 21:21:22,808 INFO  L158              Benchmark]: SmtParser took 0.34ms. Allocated memory is still 234.9MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:22,808 INFO  L158              Benchmark]: ChcToBoogie took 44.38ms. Allocated memory is still 234.9MB. Free memory was 161.7MB in the beginning and 160.8MB in the end (delta: 894.9kB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:22,808 INFO  L158              Benchmark]: Boogie Preprocessor took 98.43ms. Allocated memory is still 234.9MB. Free memory was 160.8MB in the beginning and 158.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:22,809 INFO  L158              Benchmark]: RCFGBuilder took 440.13ms. Allocated memory is still 234.9MB. Free memory was 158.4MB in the beginning and 143.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:22,810 INFO  L158              Benchmark]: TraceAbstraction took 2934.15ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 142.9MB in the beginning and 75.6MB in the end (delta: 67.3MB). Peak memory consumption was 3.4MB. Max. memory is 33.6GB.
[2025-04-28 21:21:22,814 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.34ms. Allocated memory is still 234.9MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 44.38ms. Allocated memory is still 234.9MB. Free memory was 161.7MB in the beginning and 160.8MB in the end (delta: 894.9kB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 98.43ms. Allocated memory is still 234.9MB. Free memory was 160.8MB in the beginning and 158.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 440.13ms. Allocated memory is still 234.9MB. Free memory was 158.4MB in the beginning and 143.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 2934.15ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 142.9MB in the beginning and 75.6MB in the end (delta: 67.3MB). Peak memory consumption was 3.4MB. 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_I_7 == hbv_False_G_8 && hbv_False_J_1 == hbv_False_H_2) && !(hbv_False_F_5 + 1 <= hbv_False_E_6)) && !(hbv_False_D_9 + 1 <= hbv_False_C_10)) && hbv_False_B_3 != hbv_False_A_4;
      VAL   [hbv_False_A_4=-1, hbv_False_B_3=-2, hbv_False_C_10=1, hbv_False_D_9=1, hbv_False_E_6=1, hbv_False_F_5=1, hbv_False_G_8=1, hbv_False_H_2=0, hbv_False_I_7=1, hbv_False_J_1=0]
[L0]  CALL  call INV1(hbv_False_C_10, hbv_False_A_4, hbv_False_D_9, hbv_False_E_6, hbv_False_B_3, hbv_False_F_5, hbv_False_G_8, hbv_False_H_2, hbv_False_I_7, hbv_False_J_1);
      VAL   [hhv_INV1_A_0=1, hhv_INV1_B_1=-1, hhv_INV1_C_2=1, hhv_INV1_D_3=1, hhv_INV1_E_4=-2, hhv_INV1_F_5=1, hhv_INV1_G_6=1, hhv_INV1_H_7=0, hhv_INV1_I_8=1, hhv_INV1_J_9=0]
[L0]        assume ((((hhv_INV1_J_9 == hhv_INV1_H_7 && !(hbv_INV1_K_1 < hbv_INV1_L_2 + 1)) && hhv_INV1_I_8 == hhv_INV1_G_6) && !(hhv_INV1_A_0 + 1 <= hhv_INV1_C_2)) && !(hbv_INV1_M_3 < hbv_INV1_L_4 + 1)) && !(hhv_INV1_D_3 + 1 <= hhv_INV1_F_5);
      VAL   [hbv_INV1_K_1=1, hbv_INV1_L_2=0, hbv_INV1_L_4=0, hbv_INV1_M_3=1, hhv_INV1_A_0=1, hhv_INV1_B_1=-1, hhv_INV1_C_2=1, hhv_INV1_D_3=1, hhv_INV1_E_4=-2, hhv_INV1_F_5=1, hhv_INV1_G_6=1, hhv_INV1_H_7=0, hhv_INV1_I_8=1, hhv_INV1_J_9=0]
[L0]  CALL  call INV1(hbv_INV1_M_3, hbv_INV1_O_5, hbv_INV1_L_4, hbv_INV1_K_1, hbv_INV1_P_6, hbv_INV1_L_2, hhv_INV1_G_6, hhv_INV1_H_7, hhv_INV1_I_8, hhv_INV1_J_9);
      VAL   [hhv_INV1_A_0=1, hhv_INV1_B_1=0, hhv_INV1_C_2=0, hhv_INV1_D_3=1, hhv_INV1_E_4=0, hhv_INV1_F_5=0, hhv_INV1_G_6=1, hhv_INV1_H_7=0, hhv_INV1_I_8=1, hhv_INV1_J_9=0]
[L0]        assume ((((((hhv_INV1_J_9 == hhv_INV1_E_4 && hhv_INV1_F_5 == 0) && hhv_INV1_H_7 == hhv_INV1_B_1) && hhv_INV1_D_3 == hhv_INV1_A_0) && hhv_INV1_E_4 == hhv_INV1_B_1) && hhv_INV1_C_2 == 0) && hhv_INV1_G_6 == hhv_INV1_A_0) && hhv_INV1_I_8 == hhv_INV1_D_3;
      VAL   [hhv_INV1_A_0=1, hhv_INV1_B_1=0, hhv_INV1_C_2=0, hhv_INV1_D_3=1, hhv_INV1_E_4=0, hhv_INV1_F_5=0, hhv_INV1_G_6=1, hhv_INV1_H_7=0, hhv_INV1_I_8=1, hhv_INV1_J_9=0]
[L0]  RET   call INV1(hbv_INV1_M_3, hbv_INV1_O_5, hbv_INV1_L_4, hbv_INV1_K_1, hbv_INV1_P_6, hbv_INV1_L_2, hhv_INV1_G_6, hhv_INV1_H_7, hhv_INV1_I_8, hhv_INV1_J_9);
      VAL   [hbv_INV1_K_1=1, hbv_INV1_L_2=0, hbv_INV1_L_4=0, hbv_INV1_M_3=1, hbv_INV1_O_5=0, hbv_INV1_P_6=0, hhv_INV1_A_0=1, hhv_INV1_B_1=-1, hhv_INV1_C_2=1, hhv_INV1_D_3=1, hhv_INV1_E_4=-2, hhv_INV1_F_5=1, hhv_INV1_G_6=1, hhv_INV1_H_7=0, hhv_INV1_I_8=1, hhv_INV1_J_9=0]
[L0]  CALL  call INV2(hhv_INV1_A_0, hhv_INV1_B_1, hhv_INV1_C_2, hhv_INV1_D_3, hhv_INV1_E_4, hhv_INV1_F_5, hhv_INV1_G_6, hhv_INV1_H_7, hhv_INV1_I_8, hhv_INV1_J_9);
      VAL   [hhv_INV2_A_0=1, hhv_INV2_B_1=-1, hhv_INV2_C_2=1, hhv_INV2_D_3=1, hhv_INV2_E_4=-2, hhv_INV2_F_5=1, hhv_INV2_G_6=1, hhv_INV2_H_7=0, hhv_INV2_I_8=1, hhv_INV2_J_9=0]
[L0]        assume ((((((hbv_INV2_N_2 + 1 == hhv_INV2_F_5 && !(hhv_INV2_A_0 < hbv_INV2_L_3 + 1)) && !(hhv_INV2_D_3 < hbv_INV2_N_2 + 1)) && hhv_INV2_B_1 + 1 == hbv_INV2_K_1) && hhv_INV2_C_2 == hbv_INV2_L_3 + 1) && hhv_INV2_J_9 == hhv_INV2_H_7) && hhv_INV2_I_8 == hhv_INV2_G_6) && hbv_INV2_M_4 == 2 + hhv_INV2_E_4;
      VAL   [hbv_INV2_K_1=0, hbv_INV2_L_3=0, hbv_INV2_M_4=0, hbv_INV2_N_2=0, hhv_INV2_A_0=1, hhv_INV2_B_1=-1, hhv_INV2_C_2=1, hhv_INV2_D_3=1, hhv_INV2_E_4=-2, hhv_INV2_F_5=1, hhv_INV2_G_6=1, hhv_INV2_H_7=0, hhv_INV2_I_8=1, hhv_INV2_J_9=0]
[L0]  CALL  call INV1(hhv_INV2_A_0, hbv_INV2_K_1, hbv_INV2_L_3, hhv_INV2_D_3, hbv_INV2_M_4, hbv_INV2_N_2, hhv_INV2_G_6, hhv_INV2_H_7, hhv_INV2_I_8, hhv_INV2_J_9);
      VAL   [hhv_INV1_A_0=1, hhv_INV1_B_1=0, hhv_INV1_C_2=0, hhv_INV1_D_3=1, hhv_INV1_E_4=0, hhv_INV1_F_5=0, hhv_INV1_G_6=1, hhv_INV1_H_7=0, hhv_INV1_I_8=1, hhv_INV1_J_9=0]
[L0]        assume ((((((hhv_INV1_J_9 == hhv_INV1_E_4 && hhv_INV1_F_5 == 0) && hhv_INV1_H_7 == hhv_INV1_B_1) && hhv_INV1_D_3 == hhv_INV1_A_0) && hhv_INV1_E_4 == hhv_INV1_B_1) && hhv_INV1_C_2 == 0) && hhv_INV1_G_6 == hhv_INV1_A_0) && hhv_INV1_I_8 == hhv_INV1_D_3;
      VAL   [hhv_INV1_A_0=1, hhv_INV1_B_1=0, hhv_INV1_C_2=0, hhv_INV1_D_3=1, hhv_INV1_E_4=0, hhv_INV1_F_5=0, hhv_INV1_G_6=1, hhv_INV1_H_7=0, hhv_INV1_I_8=1, hhv_INV1_J_9=0]
[L0]  RET   call INV1(hhv_INV2_A_0, hbv_INV2_K_1, hbv_INV2_L_3, hhv_INV2_D_3, hbv_INV2_M_4, hbv_INV2_N_2, hhv_INV2_G_6, hhv_INV2_H_7, hhv_INV2_I_8, hhv_INV2_J_9);
      VAL   [hbv_INV2_K_1=0, hbv_INV2_L_3=0, hbv_INV2_M_4=0, hbv_INV2_N_2=0, hhv_INV2_A_0=1, hhv_INV2_B_1=-1, hhv_INV2_C_2=1, hhv_INV2_D_3=1, hhv_INV2_E_4=-2, hhv_INV2_F_5=1, hhv_INV2_G_6=1, hhv_INV2_H_7=0, hhv_INV2_I_8=1, hhv_INV2_J_9=0]
[L0]  RET   call INV2(hhv_INV1_A_0, hhv_INV1_B_1, hhv_INV1_C_2, hhv_INV1_D_3, hhv_INV1_E_4, hhv_INV1_F_5, hhv_INV1_G_6, hhv_INV1_H_7, hhv_INV1_I_8, hhv_INV1_J_9);
      VAL   [hbv_INV1_K_1=1, hbv_INV1_L_2=0, hbv_INV1_L_4=0, hbv_INV1_M_3=1, hbv_INV1_O_5=0, hbv_INV1_P_6=0, hhv_INV1_A_0=1, hhv_INV1_B_1=-1, hhv_INV1_C_2=1, hhv_INV1_D_3=1, hhv_INV1_E_4=-2, hhv_INV1_F_5=1, hhv_INV1_G_6=1, hhv_INV1_H_7=0, hhv_INV1_I_8=1, hhv_INV1_J_9=0]
[L0]  RET   call INV1(hbv_False_C_10, hbv_False_A_4, hbv_False_D_9, hbv_False_E_6, hbv_False_B_3, hbv_False_F_5, hbv_False_G_8, hbv_False_H_2, hbv_False_I_7, hbv_False_J_1);
      VAL   [hbv_False_A_4=-1, hbv_False_B_3=-2, hbv_False_C_10=1, hbv_False_D_9=1, hbv_False_E_6=1, hbv_False_F_5=1, hbv_False_G_8=1, hbv_False_H_2=0, hbv_False_I_7=1, hbv_False_J_1=0]
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 6 procedures, 40 locations, 84 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 238 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 148 IncrementalHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 149 mSDtfsCounter, 148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 223 SizeOfPredicates, 12 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 32/36 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:22,831 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
