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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:28,001 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:28,078 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a07db2-abfc-4271-9aba-12c5417743f6/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:28,083 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:28,084 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:28,122 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:28,123 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:28,123 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:28,124 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:28,124 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:28,125 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:28,125 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:28,125 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:28,125 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:28,125 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:28,126 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:28,126 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:28,126 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:28,128 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:28,128 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:28,128 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:28,128 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:28,128 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:28,128 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:28,128 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:28,129 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:28,129 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:28,463 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:28,479 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:28,481 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:28,486 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:28,487 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:28,488 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a07db2-abfc-4271-9aba-12c5417743f6/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-116.smt2
[2025-04-28 21:21:28,491 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:28,496 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:28,680 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5a07db2-abfc-4271-9aba-12c5417743f6/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-116.smt2
[2025-04-28 21:21:28,683 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:28,684 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:28,685 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:28,685 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:28,685 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:28,688 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:28" (1/1) ...
[2025-04-28 21:21:28,710 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:28 Unit
[2025-04-28 21:21:28,710 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:28,711 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:28,711 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:28,711 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:28,728 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:28" (1/1) ...
[2025-04-28 21:21:28,728 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:28" (1/1) ...
[2025-04-28 21:21:28,747 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:28" (1/1) ...
[2025-04-28 21:21:28,747 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:28" (1/1) ...
[2025-04-28 21:21:28,749 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:28" (1/1) ...
[2025-04-28 21:21:28,750 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:28" (1/1) ...
[2025-04-28 21:21:28,752 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:28" (1/1) ...
[2025-04-28 21:21:28,752 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:28" (1/1) ...
[2025-04-28 21:21:28,753 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:28" (1/1) ...
[2025-04-28 21:21:28,763 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:28,763 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:28,764 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:28,764 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:28,765 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:28" (1/1) ...
[2025-04-28 21:21:28,767 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:28,782 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:28,799 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:28,806 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:28,820 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:28,820 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:28,821 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:28,821 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure WEE given in one single declaration
[2025-04-28 21:21:28,821 INFO  L130     BoogieDeclarations]: Found specification of procedure WEE
[2025-04-28 21:21:28,821 INFO  L138     BoogieDeclarations]: Found implementation of procedure WEE
[2025-04-28 21:21:28,822 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure SAD given in one single declaration
[2025-04-28 21:21:28,822 INFO  L130     BoogieDeclarations]: Found specification of procedure SAD
[2025-04-28 21:21:28,822 INFO  L138     BoogieDeclarations]: Found implementation of procedure SAD
[2025-04-28 21:21:28,822 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure FUN given in one single declaration
[2025-04-28 21:21:28,822 INFO  L130     BoogieDeclarations]: Found specification of procedure FUN
[2025-04-28 21:21:28,823 INFO  L138     BoogieDeclarations]: Found implementation of procedure FUN
[2025-04-28 21:21:28,824 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:28,824 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:28,824 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:28,879 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:28,881 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:28,978 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:28,978 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:28,991 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:28,992 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:28,992 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:28 BoogieIcfgContainer
[2025-04-28 21:21:28,992 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:28,997 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:28,997 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:29,002 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:29,002 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:28" (1/3) ...
[2025-04-28 21:21:29,003 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36199daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:29, skipping insertion in model container
[2025-04-28 21:21:29,003 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:28" (2/3) ...
[2025-04-28 21:21:29,004 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36199daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:29, skipping insertion in model container
[2025-04-28 21:21:29,004 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:28" (3/3) ...
[2025-04-28 21:21:29,005 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:29,022 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:29,025 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 5 procedures, 23 locations, 35 edges, 5 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:29,072 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:29,084 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;@7fc434d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:29,085 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:29,089 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 23 states, 10 states have (on average 1.4) internal successors, (14), 14 states have internal predecessors, (14), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7)
[2025-04-28 21:21:29,102 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:29,103 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:29,103 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:29,104 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:29,110 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:29,112 INFO  L85        PathProgramCache]: Analyzing trace with hash -2112874530, now seen corresponding path program 1 times
[2025-04-28 21:21:29,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:29,121 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504910292]
[2025-04-28 21:21:29,121 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:29,162 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:29,195 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:29,196 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,199 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,479 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:29,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:29,480 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504910292]
[2025-04-28 21:21:29,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504910292] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:29,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:29,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:29,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186976003]
[2025-04-28 21:21:29,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:29,489 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:29,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:29,515 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:29,516 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:29,518 INFO  L87              Difference]: Start difference. First operand  has 23 states, 10 states have (on average 1.4) internal successors, (14), 14 states have internal predecessors, (14), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand  has 7 states, 5 states have (on average 1.8) internal successors, (9), 7 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:29,686 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:29,687 INFO  L93              Difference]: Finished difference Result 23 states and 28 transitions.
[2025-04-28 21:21:29,689 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:29,690 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 1.8) internal successors, (9), 7 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17
[2025-04-28 21:21:29,691 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:29,700 INFO  L225             Difference]: With dead ends: 23
[2025-04-28 21:21:29,701 INFO  L226             Difference]: Without dead ends: 23
[2025-04-28 21:21:29,703 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:29,710 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:29,711 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 105 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:29,734 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2025-04-28 21:21:29,805 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2025-04-28 21:21:29,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8)
[2025-04-28 21:21:29,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions.
[2025-04-28 21:21:29,815 INFO  L79                 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 17
[2025-04-28 21:21:29,816 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:29,816 INFO  L485      AbstractCegarLoop]: Abstraction has 23 states and 28 transitions.
[2025-04-28 21:21:29,816 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 1.8) internal successors, (9), 7 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:29,816 INFO  L278                IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions.
[2025-04-28 21:21:29,818 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:29,818 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:29,819 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:29,819 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:29,819 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:29,820 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:29,820 INFO  L85        PathProgramCache]: Analyzing trace with hash -787432989, now seen corresponding path program 1 times
[2025-04-28 21:21:29,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:29,820 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050537008]
[2025-04-28 21:21:29,820 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:29,833 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:29,852 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:29,853 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,853 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,147 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:30,147 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:30,147 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050537008]
[2025-04-28 21:21:30,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050537008] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:30,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:30,148 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:30,148 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276450013]
[2025-04-28 21:21:30,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:30,150 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:30,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:30,152 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:30,152 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:30,153 INFO  L87              Difference]: Start difference. First operand 23 states and 28 transitions. Second operand  has 6 states, 4 states have (on average 2.75) internal successors, (11), 6 states have internal predecessors, (11), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:30,253 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:30,254 INFO  L93              Difference]: Finished difference Result 27 states and 32 transitions.
[2025-04-28 21:21:30,255 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:30,255 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.75) internal successors, (11), 6 states have internal predecessors, (11), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 21
[2025-04-28 21:21:30,255 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:30,256 INFO  L225             Difference]: With dead ends: 27
[2025-04-28 21:21:30,256 INFO  L226             Difference]: Without dead ends: 25
[2025-04-28 21:21:30,257 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:30,258 INFO  L437           NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:30,258 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 95 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:30,259 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2025-04-28 21:21:30,265 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2025-04-28 21:21:30,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 14 states have internal predecessors, (14), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9)
[2025-04-28 21:21:30,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions.
[2025-04-28 21:21:30,267 INFO  L79                 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 21
[2025-04-28 21:21:30,267 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:30,267 INFO  L485      AbstractCegarLoop]: Abstraction has 25 states and 30 transitions.
[2025-04-28 21:21:30,267 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.75) internal successors, (11), 6 states have internal predecessors, (11), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:30,268 INFO  L278                IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions.
[2025-04-28 21:21:30,272 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:30,272 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,272 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:30,273 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:30,273 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,274 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -2133262811, now seen corresponding path program 1 times
[2025-04-28 21:21:30,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,275 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388498604]
[2025-04-28 21:21:30,276 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,291 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:30,314 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:30,314 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,315 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:30,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:30,637 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388498604]
[2025-04-28 21:21:30,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388498604] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:30,637 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:30,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:30,638 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16681133]
[2025-04-28 21:21:30,638 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:30,638 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:30,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:30,639 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:30,639 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:30,639 INFO  L87              Difference]: Start difference. First operand 25 states and 30 transitions. Second operand  has 8 states, 5 states have (on average 2.4) internal successors, (12), 8 states have internal predecessors, (12), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:30,823 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:30,824 INFO  L93              Difference]: Finished difference Result 33 states and 39 transitions.
[2025-04-28 21:21:30,824 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:30,824 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 2.4) internal successors, (12), 8 states have internal predecessors, (12), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25
[2025-04-28 21:21:30,825 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:30,827 INFO  L225             Difference]: With dead ends: 33
[2025-04-28 21:21:30,828 INFO  L226             Difference]: Without dead ends: 27
[2025-04-28 21:21:30,828 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:30,829 INFO  L437           NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:30,829 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 129 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:30,830 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2025-04-28 21:21:30,836 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2025-04-28 21:21:30,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27 states, 12 states have (on average 1.25) internal successors, (15), 15 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10)
[2025-04-28 21:21:30,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions.
[2025-04-28 21:21:30,841 INFO  L79                 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 25
[2025-04-28 21:21:30,841 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:30,841 INFO  L485      AbstractCegarLoop]: Abstraction has 27 states and 32 transitions.
[2025-04-28 21:21:30,841 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 2.4) internal successors, (12), 8 states have internal predecessors, (12), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:30,842 INFO  L278                IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions.
[2025-04-28 21:21:30,842 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:30,842 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,843 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:30,843 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:30,843 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,843 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,844 INFO  L85        PathProgramCache]: Analyzing trace with hash 1801574599, now seen corresponding path program 1 times
[2025-04-28 21:21:30,844 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,844 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782617827]
[2025-04-28 21:21:30,846 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,846 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,860 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:30,880 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:30,882 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,883 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:31,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,321 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782617827]
[2025-04-28 21:21:31,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782617827] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:31,321 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742331589]
[2025-04-28 21:21:31,321 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,321 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:31,325 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:31,327 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:31,333 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:31,376 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:31,399 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:31,399 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,399 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,402 INFO  L256         TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:31,409 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:31,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:31,709 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:32,914 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:32,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [742331589] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:32,915 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:32,915 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 23
[2025-04-28 21:21:32,915 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465534622]
[2025-04-28 21:21:32,916 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:32,917 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-04-28 21:21:32,917 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:32,918 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-04-28 21:21:32,920 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:32,920 INFO  L87              Difference]: Start difference. First operand 27 states and 32 transitions. Second operand  has 23 states, 10 states have (on average 2.4) internal successors, (24), 22 states have internal predecessors, (24), 14 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (16), 8 states have call predecessors, (16), 14 states have call successors, (16)
[2025-04-28 21:21:33,444 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,444 INFO  L93              Difference]: Finished difference Result 46 states and 57 transitions.
[2025-04-28 21:21:33,445 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-04-28 21:21:33,445 INFO  L79                 Accepts]: Start accepts. Automaton has  has 23 states, 10 states have (on average 2.4) internal successors, (24), 22 states have internal predecessors, (24), 14 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (16), 8 states have call predecessors, (16), 14 states have call successors, (16) Word has length 29
[2025-04-28 21:21:33,445 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,446 INFO  L225             Difference]: With dead ends: 46
[2025-04-28 21:21:33,447 INFO  L226             Difference]: Without dead ends: 41
[2025-04-28 21:21:33,447 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930
[2025-04-28 21:21:33,448 INFO  L437           NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,448 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 282 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:33,449 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2025-04-28 21:21:33,455 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37.
[2025-04-28 21:21:33,455 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 11 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16)
[2025-04-28 21:21:33,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions.
[2025-04-28 21:21:33,456 INFO  L79                 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 29
[2025-04-28 21:21:33,456 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,457 INFO  L485      AbstractCegarLoop]: Abstraction has 37 states and 44 transitions.
[2025-04-28 21:21:33,457 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 10 states have (on average 2.4) internal successors, (24), 22 states have internal predecessors, (24), 14 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (16), 8 states have call predecessors, (16), 14 states have call successors, (16)
[2025-04-28 21:21:33,457 INFO  L278                IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions.
[2025-04-28 21:21:33,458 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:33,458 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,458 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,464 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:33,662 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,662 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,663 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,663 INFO  L85        PathProgramCache]: Analyzing trace with hash -1593910551, now seen corresponding path program 2 times
[2025-04-28 21:21:33,663 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,663 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044158984]
[2025-04-28 21:21:33,663 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:33,663 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,670 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes.
[2025-04-28 21:21:33,678 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:33,678 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:33,678 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:33,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,962 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044158984]
[2025-04-28 21:21:33,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044158984] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:33,962 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856701454]
[2025-04-28 21:21:33,962 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:33,963 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,965 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,968 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:33,973 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:34,016 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes.
[2025-04-28 21:21:34,037 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:34,037 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:34,037 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,040 INFO  L256         TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:34,042 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:34,172 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:34,172 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:36,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:36,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [856701454] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:36,561 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:36,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20
[2025-04-28 21:21:36,562 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279198356]
[2025-04-28 21:21:36,562 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,564 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-04-28 21:21:36,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,565 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-04-28 21:21:36,565 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:21:36,566 INFO  L87              Difference]: Start difference. First operand 37 states and 44 transitions. Second operand  has 20 states, 10 states have (on average 2.3) internal successors, (23), 20 states have internal predecessors, (23), 11 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (16), 8 states have call predecessors, (16), 11 states have call successors, (16)
[2025-04-28 21:21:36,820 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,821 INFO  L93              Difference]: Finished difference Result 47 states and 57 transitions.
[2025-04-28 21:21:36,821 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:36,821 INFO  L79                 Accepts]: Start accepts. Automaton has  has 20 states, 10 states have (on average 2.3) internal successors, (23), 20 states have internal predecessors, (23), 11 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (16), 8 states have call predecessors, (16), 11 states have call successors, (16) Word has length 33
[2025-04-28 21:21:36,822 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,823 INFO  L225             Difference]: With dead ends: 47
[2025-04-28 21:21:36,823 INFO  L226             Difference]: Without dead ends: 45
[2025-04-28 21:21:36,824 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:21:36,825 INFO  L437           NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,825 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 277 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:36,826 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2025-04-28 21:21:36,832 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39.
[2025-04-28 21:21:36,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 8 states have call successors, (8), 5 states have call predecessors, (8), 12 states have return successors, (18), 12 states have call predecessors, (18), 8 states have call successors, (18)
[2025-04-28 21:21:36,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions.
[2025-04-28 21:21:36,834 INFO  L79                 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 33
[2025-04-28 21:21:36,834 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,834 INFO  L485      AbstractCegarLoop]: Abstraction has 39 states and 47 transitions.
[2025-04-28 21:21:36,834 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 10 states have (on average 2.3) internal successors, (23), 20 states have internal predecessors, (23), 11 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (16), 8 states have call predecessors, (16), 11 states have call successors, (16)
[2025-04-28 21:21:36,834 INFO  L278                IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions.
[2025-04-28 21:21:36,835 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:36,835 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,836 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:36,844 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:37,040 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,040 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:37,041 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:37,041 INFO  L85        PathProgramCache]: Analyzing trace with hash 1442810633, now seen corresponding path program 3 times
[2025-04-28 21:21:37,041 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:37,041 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692038658]
[2025-04-28 21:21:37,041 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:37,041 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,051 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes.
[2025-04-28 21:21:37,059 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:37,060 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:37,060 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,254 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:37,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,254 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692038658]
[2025-04-28 21:21:37,255 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692038658] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:37,255 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403134763]
[2025-04-28 21:21:37,255 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:37,255 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,258 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:37,260 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:37,263 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:37,323 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes.
[2025-04-28 21:21:37,345 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:37,346 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:37,346 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,348 INFO  L256         TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:37,349 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:37,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:37,436 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:38,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:38,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403134763] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:38,771 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:38,771 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19
[2025-04-28 21:21:38,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223432695]
[2025-04-28 21:21:38,771 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:38,773 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-04-28 21:21:38,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:38,775 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-04-28 21:21:38,776 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:38,776 INFO  L87              Difference]: Start difference. First operand 39 states and 47 transitions. Second operand  has 19 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 19 states have internal predecessors, (23), 12 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (16), 9 states have call predecessors, (16), 12 states have call successors, (16)
[2025-04-28 21:21:38,961 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:38,961 INFO  L93              Difference]: Finished difference Result 49 states and 59 transitions.
[2025-04-28 21:21:38,961 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:38,962 INFO  L79                 Accepts]: Start accepts. Automaton has  has 19 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 19 states have internal predecessors, (23), 12 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (16), 9 states have call predecessors, (16), 12 states have call successors, (16) Word has length 33
[2025-04-28 21:21:38,962 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:38,963 INFO  L225             Difference]: With dead ends: 49
[2025-04-28 21:21:38,963 INFO  L226             Difference]: Without dead ends: 47
[2025-04-28 21:21:38,963 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:38,964 INFO  L437           NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:38,964 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 273 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:38,965 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2025-04-28 21:21:38,970 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31.
[2025-04-28 21:21:38,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 17 states have internal predecessors, (17), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11)
[2025-04-28 21:21:38,971 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions.
[2025-04-28 21:21:38,971 INFO  L79                 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 33
[2025-04-28 21:21:38,971 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,971 INFO  L485      AbstractCegarLoop]: Abstraction has 31 states and 36 transitions.
[2025-04-28 21:21:38,972 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 19 states have internal predecessors, (23), 12 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (16), 9 states have call predecessors, (16), 12 states have call successors, (16)
[2025-04-28 21:21:38,972 INFO  L278                IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions.
[2025-04-28 21:21:38,972 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:38,973 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,973 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:38,977 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:21:39,173 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:39,173 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,174 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 406138380, now seen corresponding path program 4 times
[2025-04-28 21:21:39,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,174 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463939006]
[2025-04-28 21:21:39,174 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:39,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,182 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes.
[2025-04-28 21:21:39,189 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:39,190 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:39,190 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:39,358 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,358 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463939006]
[2025-04-28 21:21:39,358 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463939006] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:39,358 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549362913]
[2025-04-28 21:21:39,359 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:39,359 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:39,361 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:39,363 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:39,367 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:39,432 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes.
[2025-04-28 21:21:39,448 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:39,449 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:39,449 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,450 INFO  L256         TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:39,452 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:39,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:39,557 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:40,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:40,579 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549362913] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:40,579 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:40,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17
[2025-04-28 21:21:40,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437505716]
[2025-04-28 21:21:40,579 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,580 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:40,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,580 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:40,581 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:40,581 INFO  L87              Difference]: Start difference. First operand 31 states and 36 transitions. Second operand  has 17 states, 8 states have (on average 2.875) internal successors, (23), 17 states have internal predecessors, (23), 11 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (15), 8 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:40,717 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,717 INFO  L93              Difference]: Finished difference Result 37 states and 42 transitions.
[2025-04-28 21:21:40,718 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:40,718 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 8 states have (on average 2.875) internal successors, (23), 17 states have internal predecessors, (23), 11 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (15), 8 states have call predecessors, (15), 11 states have call successors, (15) Word has length 33
[2025-04-28 21:21:40,718 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,719 INFO  L225             Difference]: With dead ends: 37
[2025-04-28 21:21:40,719 INFO  L226             Difference]: Without dead ends: 33
[2025-04-28 21:21:40,720 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420
[2025-04-28 21:21:40,720 INFO  L437           NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,720 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 187 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:40,721 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2025-04-28 21:21:40,724 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2025-04-28 21:21:40,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 15 states have (on average 1.2) internal successors, (18), 18 states have internal predecessors, (18), 8 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12)
[2025-04-28 21:21:40,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions.
[2025-04-28 21:21:40,725 INFO  L79                 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 33
[2025-04-28 21:21:40,726 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,726 INFO  L485      AbstractCegarLoop]: Abstraction has 33 states and 38 transitions.
[2025-04-28 21:21:40,726 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 8 states have (on average 2.875) internal successors, (23), 17 states have internal predecessors, (23), 11 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (15), 8 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:40,726 INFO  L278                IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions.
[2025-04-28 21:21:40,727 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-04-28 21:21:40,727 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,727 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,733 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:40,927 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:40,928 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,928 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,928 INFO  L85        PathProgramCache]: Analyzing trace with hash -276565938, now seen corresponding path program 5 times
[2025-04-28 21:21:40,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,928 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605595381]
[2025-04-28 21:21:40,928 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:40,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,933 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 3 equivalence classes.
[2025-04-28 21:21:40,946 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:40,946 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s)
[2025-04-28 21:21:40,946 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-04-28 21:21:41,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:41,292 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605595381]
[2025-04-28 21:21:41,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605595381] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:41,292 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629849414]
[2025-04-28 21:21:41,292 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:41,292 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:41,295 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:41,297 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:41,302 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:41,386 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 3 equivalence classes.
[2025-04-28 21:21:41,408 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:41,409 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s)
[2025-04-28 21:21:41,409 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,411 INFO  L256         TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:41,413 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:41,620 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:21:41,621 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:43,152 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:21:43,152 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [629849414] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:43,152 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:43,152 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 25
[2025-04-28 21:21:43,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92334717]
[2025-04-28 21:21:43,153 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:43,153 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2025-04-28 21:21:43,153 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:43,154 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2025-04-28 21:21:43,154 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600
[2025-04-28 21:21:43,155 INFO  L87              Difference]: Start difference. First operand 33 states and 38 transitions. Second operand  has 25 states, 11 states have (on average 3.0) internal successors, (33), 25 states have internal predecessors, (33), 15 states have call successors, (19), 1 states have call predecessors, (19), 10 states have return successors, (19), 8 states have call predecessors, (19), 15 states have call successors, (19)
[2025-04-28 21:21:43,456 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:43,457 INFO  L93              Difference]: Finished difference Result 45 states and 51 transitions.
[2025-04-28 21:21:43,457 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:21:43,457 INFO  L79                 Accepts]: Start accepts. Automaton has  has 25 states, 11 states have (on average 3.0) internal successors, (33), 25 states have internal predecessors, (33), 15 states have call successors, (19), 1 states have call predecessors, (19), 10 states have return successors, (19), 8 states have call predecessors, (19), 15 states have call successors, (19) Word has length 37
[2025-04-28 21:21:43,457 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:43,458 INFO  L225             Difference]: With dead ends: 45
[2025-04-28 21:21:43,458 INFO  L226             Difference]: Without dead ends: 36
[2025-04-28 21:21:43,459 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056
[2025-04-28 21:21:43,459 INFO  L437           NwaCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:43,460 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 299 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:43,460 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2025-04-28 21:21:43,464 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2025-04-28 21:21:43,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 6 states have call predecessors, (8), 10 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13)
[2025-04-28 21:21:43,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions.
[2025-04-28 21:21:43,465 INFO  L79                 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 37
[2025-04-28 21:21:43,465 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:43,465 INFO  L485      AbstractCegarLoop]: Abstraction has 36 states and 41 transitions.
[2025-04-28 21:21:43,465 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 11 states have (on average 3.0) internal successors, (33), 25 states have internal predecessors, (33), 15 states have call successors, (19), 1 states have call predecessors, (19), 10 states have return successors, (19), 8 states have call predecessors, (19), 15 states have call successors, (19)
[2025-04-28 21:21:43,466 INFO  L278                IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions.
[2025-04-28 21:21:43,466 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-04-28 21:21:43,466 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:43,467 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:43,472 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:43,667 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:43,667 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:43,668 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:43,668 INFO  L85        PathProgramCache]: Analyzing trace with hash 515159408, now seen corresponding path program 6 times
[2025-04-28 21:21:43,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:43,668 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390898480]
[2025-04-28 21:21:43,668 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-04-28 21:21:43,668 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:43,673 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 3 equivalence classes.
[2025-04-28 21:21:43,699 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:43,702 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s)
[2025-04-28 21:21:43,702 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,180 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-04-28 21:21:44,181 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:44,181 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390898480]
[2025-04-28 21:21:44,181 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390898480] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:44,181 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913954537]
[2025-04-28 21:21:44,181 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-04-28 21:21:44,181 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,184 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:44,186 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:44,189 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:44,278 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 3 equivalence classes.
[2025-04-28 21:21:44,303 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:44,303 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s)
[2025-04-28 21:21:44,303 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,305 INFO  L256         TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 50 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:44,307 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:44,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-04-28 21:21:44,471 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:45,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-04-28 21:21:45,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [913954537] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:45,898 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:45,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 20] total 29
[2025-04-28 21:21:45,899 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856029537]
[2025-04-28 21:21:45,899 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:45,899 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2025-04-28 21:21:45,899 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:45,900 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2025-04-28 21:21:45,900 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812
[2025-04-28 21:21:45,900 INFO  L87              Difference]: Start difference. First operand 36 states and 41 transitions. Second operand  has 29 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 28 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 12 states have return successors, (23), 11 states have call predecessors, (23), 17 states have call successors, (23)
[2025-04-28 21:21:46,709 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:46,709 INFO  L93              Difference]: Finished difference Result 60 states and 68 transitions.
[2025-04-28 21:21:46,710 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-04-28 21:21:46,711 INFO  L79                 Accepts]: Start accepts. Automaton has  has 29 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 28 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 12 states have return successors, (23), 11 states have call predecessors, (23), 17 states have call successors, (23) Word has length 41
[2025-04-28 21:21:46,711 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:46,711 INFO  L225             Difference]: With dead ends: 60
[2025-04-28 21:21:46,712 INFO  L226             Difference]: Without dead ends: 44
[2025-04-28 21:21:46,713 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722
[2025-04-28 21:21:46,713 INFO  L437           NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:46,714 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 398 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:21:46,714 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2025-04-28 21:21:46,724 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40.
[2025-04-28 21:21:46,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 6 states have call predecessors, (8), 12 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16)
[2025-04-28 21:21:46,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions.
[2025-04-28 21:21:46,725 INFO  L79                 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 41
[2025-04-28 21:21:46,725 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:46,725 INFO  L485      AbstractCegarLoop]: Abstraction has 40 states and 46 transitions.
[2025-04-28 21:21:46,725 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 28 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 12 states have return successors, (23), 11 states have call predecessors, (23), 17 states have call successors, (23)
[2025-04-28 21:21:46,726 INFO  L278                IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions.
[2025-04-28 21:21:46,726 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2025-04-28 21:21:46,727 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:46,727 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:46,736 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:46,927 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-04-28 21:21:46,927 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:46,928 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:46,928 INFO  L85        PathProgramCache]: Analyzing trace with hash 1430782482, now seen corresponding path program 7 times
[2025-04-28 21:21:46,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:46,928 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938380498]
[2025-04-28 21:21:46,928 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-04-28 21:21:46,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:46,933 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-04-28 21:21:46,942 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-04-28 21:21:46,943 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:46,943 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,244 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-04-28 21:21:47,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:47,245 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938380498]
[2025-04-28 21:21:47,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938380498] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:47,245 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749415898]
[2025-04-28 21:21:47,245 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-04-28 21:21:47,245 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:47,248 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:47,250 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:47,253 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:47,349 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-04-28 21:21:47,370 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-04-28 21:21:47,371 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:47,371 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,372 INFO  L256         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:47,374 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:47,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-04-28 21:21:47,519 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:53,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-04-28 21:21:53,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [749415898] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:53,041 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:53,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 25
[2025-04-28 21:21:53,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038707428]
[2025-04-28 21:21:53,044 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:53,044 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2025-04-28 21:21:53,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:53,046 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2025-04-28 21:21:53,048 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600
[2025-04-28 21:21:53,048 INFO  L87              Difference]: Start difference. First operand 40 states and 46 transitions. Second operand  has 25 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 25 states have internal predecessors, (28), 13 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21)
[2025-04-28 21:21:53,334 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:53,334 INFO  L93              Difference]: Finished difference Result 54 states and 62 transitions.
[2025-04-28 21:21:53,335 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:21:53,335 INFO  L79                 Accepts]: Start accepts. Automaton has  has 25 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 25 states have internal predecessors, (28), 13 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21) Word has length 45
[2025-04-28 21:21:53,336 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:53,336 INFO  L225             Difference]: With dead ends: 54
[2025-04-28 21:21:53,336 INFO  L226             Difference]: Without dead ends: 52
[2025-04-28 21:21:53,337 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930
[2025-04-28 21:21:53,338 INFO  L437           NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:53,341 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 355 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:53,342 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2025-04-28 21:21:53,351 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48.
[2025-04-28 21:21:53,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 8 states have call successors, (8), 6 states have call predecessors, (8), 16 states have return successors, (21), 16 states have call predecessors, (21), 8 states have call successors, (21)
[2025-04-28 21:21:53,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions.
[2025-04-28 21:21:53,356 INFO  L79                 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 45
[2025-04-28 21:21:53,356 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:53,356 INFO  L485      AbstractCegarLoop]: Abstraction has 48 states and 55 transitions.
[2025-04-28 21:21:53,356 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 25 states have internal predecessors, (28), 13 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21)
[2025-04-28 21:21:53,356 INFO  L278                IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions.
[2025-04-28 21:21:53,357 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2025-04-28 21:21:53,357 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:53,357 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:53,365 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-04-28 21:21:53,558 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2025-04-28 21:21:53,558 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:53,558 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:53,559 INFO  L85        PathProgramCache]: Analyzing trace with hash -1515731534, now seen corresponding path program 8 times
[2025-04-28 21:21:53,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:53,559 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78297923]
[2025-04-28 21:21:53,559 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:53,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:53,564 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes.
[2025-04-28 21:21:53,571 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements.
[2025-04-28 21:21:53,572 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:53,572 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-04-28 21:21:53,806 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:53,806 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78297923]
[2025-04-28 21:21:53,806 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78297923] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:53,806 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157822772]
[2025-04-28 21:21:53,806 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:53,806 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:53,809 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:53,812 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:53,824 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:53,978 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes.
[2025-04-28 21:21:54,002 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements.
[2025-04-28 21:21:54,002 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:54,002 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:54,003 INFO  L256         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:54,009 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:54,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-04-28 21:21:54,134 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:56,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-04-28 21:21:56,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157822772] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:56,522 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:56,522 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 24
[2025-04-28 21:21:56,522 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484017217]
[2025-04-28 21:21:56,522 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:56,523 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-04-28 21:21:56,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:56,524 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-04-28 21:21:56,524 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:21:56,524 INFO  L87              Difference]: Start difference. First operand 48 states and 55 transitions. Second operand  has 24 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 24 states have internal predecessors, (28), 14 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (21), 12 states have call predecessors, (21), 14 states have call successors, (21)
[2025-04-28 21:21:56,737 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:56,737 INFO  L93              Difference]: Finished difference Result 62 states and 71 transitions.
[2025-04-28 21:21:56,738 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-04-28 21:21:56,738 INFO  L79                 Accepts]: Start accepts. Automaton has  has 24 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 24 states have internal predecessors, (28), 14 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (21), 12 states have call predecessors, (21), 14 states have call successors, (21) Word has length 45
[2025-04-28 21:21:56,738 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:56,739 INFO  L225             Difference]: With dead ends: 62
[2025-04-28 21:21:56,739 INFO  L226             Difference]: Without dead ends: 60
[2025-04-28 21:21:56,739 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870
[2025-04-28 21:21:56,740 INFO  L437           NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:56,741 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 301 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:56,741 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2025-04-28 21:21:56,752 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42.
[2025-04-28 21:21:56,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (17), 13 states have call predecessors, (17), 8 states have call successors, (17)
[2025-04-28 21:21:56,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions.
[2025-04-28 21:21:56,754 INFO  L79                 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 45
[2025-04-28 21:21:56,754 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:56,754 INFO  L485      AbstractCegarLoop]: Abstraction has 42 states and 48 transitions.
[2025-04-28 21:21:56,754 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 24 states have internal predecessors, (28), 14 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (21), 12 states have call predecessors, (21), 14 states have call successors, (21)
[2025-04-28 21:21:56,754 INFO  L278                IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions.
[2025-04-28 21:21:56,755 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2025-04-28 21:21:56,755 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:56,756 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:56,762 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:56,956 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2025-04-28 21:21:56,956 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:56,957 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:56,957 INFO  L85        PathProgramCache]: Analyzing trace with hash -930845129, now seen corresponding path program 9 times
[2025-04-28 21:21:56,957 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:56,957 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002414315]
[2025-04-28 21:21:56,957 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:56,957 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:56,964 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 4 equivalence classes.
[2025-04-28 21:21:56,976 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 49 of 49 statements.
[2025-04-28 21:21:56,976 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:21:56,977 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:57,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-04-28 21:21:57,255 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:57,255 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002414315]
[2025-04-28 21:21:57,255 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002414315] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:57,256 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861322790]
[2025-04-28 21:21:57,256 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:57,256 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:57,259 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:57,261 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:57,264 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:21:57,442 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 4 equivalence classes.
[2025-04-28 21:21:57,471 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 49 of 49 statements.
[2025-04-28 21:21:57,471 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:21:57,471 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:57,472 INFO  L256         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:57,474 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:57,576 INFO  L134       CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-04-28 21:21:57,576 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
