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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:26,169 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:26,257 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6416428f-879d-4054-a7c7-a6dc0987fb30/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:26,262 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:26,262 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:26,285 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:26,285 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:26,286 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:26,286 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:26,286 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:26,286 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:26,286 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:26,287 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:26,287 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:26,287 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:26,287 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:26,287 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:26,287 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:26,287 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:26,287 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:26,288 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:26,288 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:26,288 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:26,288 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:26,288 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:26,289 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:26,289 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:26,602 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:26,613 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:26,617 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:26,620 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:26,622 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:26,623 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6416428f-879d-4054-a7c7-a6dc0987fb30/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-137.smt2
[2025-04-28 21:21:26,625 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:26,634 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:26,841 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6416428f-879d-4054-a7c7-a6dc0987fb30/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-137.smt2
[2025-04-28 21:21:26,846 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:26,849 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:26,851 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:26,851 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:26,851 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:26,854 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:26" (1/1) ...
[2025-04-28 21:21:26,887 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:26 Unit
[2025-04-28 21:21:26,887 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:26,888 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:26,888 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:26,888 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:26,907 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:26" (1/1) ...
[2025-04-28 21:21:26,907 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:26" (1/1) ...
[2025-04-28 21:21:26,925 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:26" (1/1) ...
[2025-04-28 21:21:26,926 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:26" (1/1) ...
[2025-04-28 21:21:26,928 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:26" (1/1) ...
[2025-04-28 21:21:26,928 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:26" (1/1) ...
[2025-04-28 21:21:26,930 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:26" (1/1) ...
[2025-04-28 21:21:26,931 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:26" (1/1) ...
[2025-04-28 21:21:26,935 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:26" (1/1) ...
[2025-04-28 21:21:26,953 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:26,956 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:26,956 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:26,956 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:26,957 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:26" (1/1) ...
[2025-04-28 21:21:26,960 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:26,974 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:26,991 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:26,995 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:27,008 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:27,008 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:27,008 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:27,008 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure gib.DLRunknown.CLN4 given in one single declaration
[2025-04-28 21:21:27,009 INFO  L130     BoogieDeclarations]: Found specification of procedure gib.DLRunknown.CLN4
[2025-04-28 21:21:27,009 INFO  L138     BoogieDeclarations]: Found implementation of procedure gib.DLRunknown.CLN4
[2025-04-28 21:21:27,009 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:27,009 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:27,009 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:27,062 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:27,064 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:27,192 INFO  L?                        ?]: Removed 11 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:27,192 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:27,209 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:27,210 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:27,210 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:27 BoogieIcfgContainer
[2025-04-28 21:21:27,210 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:27,215 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:27,216 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:27,220 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:27,220 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:26" (1/3) ...
[2025-04-28 21:21:27,221 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3591606c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:27, skipping insertion in model container
[2025-04-28 21:21:27,221 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:26" (2/3) ...
[2025-04-28 21:21:27,222 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3591606c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:27, skipping insertion in model container
[2025-04-28 21:21:27,222 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:27" (3/3) ...
[2025-04-28 21:21:27,227 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:27,244 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:27,246 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 3 procedures, 14 locations, 21 edges, 3 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:27,296 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:27,316 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;@48590f33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:27,316 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:27,320 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 14 states, 6 states have (on average 1.5) internal successors, (9), 8 states have internal predecessors, (9), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2025-04-28 21:21:27,327 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:27,328 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,328 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:27,329 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,334 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,335 INFO  L85        PathProgramCache]: Analyzing trace with hash 778455057, now seen corresponding path program 1 times
[2025-04-28 21:21:27,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,345 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36547036]
[2025-04-28 21:21:27,345 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:27,346 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,373 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:27,393 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:27,394 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:27,394 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:27,551 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:27,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:27,552 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36547036]
[2025-04-28 21:21:27,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36547036] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:27,555 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:27,558 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:27,560 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816578847]
[2025-04-28 21:21:27,560 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:27,565 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:27,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:27,599 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:27,600 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:27,602 INFO  L87              Difference]: Start difference. First operand  has 14 states, 6 states have (on average 1.5) internal successors, (9), 8 states have internal predecessors, (9), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:27,661 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:27,661 INFO  L93              Difference]: Finished difference Result 14 states and 18 transitions.
[2025-04-28 21:21:27,663 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:27,664 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 9
[2025-04-28 21:21:27,664 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:27,671 INFO  L225             Difference]: With dead ends: 14
[2025-04-28 21:21:27,671 INFO  L226             Difference]: Without dead ends: 14
[2025-04-28 21:21:27,674 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:27,680 INFO  L437           NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:27,681 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:27,694 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2025-04-28 21:21:27,722 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2025-04-28 21:21:27,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 8 states have internal predecessors, (8), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:27,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions.
[2025-04-28 21:21:27,729 INFO  L79                 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 9
[2025-04-28 21:21:27,729 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:27,729 INFO  L485      AbstractCegarLoop]: Abstraction has 14 states and 18 transitions.
[2025-04-28 21:21:27,730 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:27,730 INFO  L278                IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions.
[2025-04-28 21:21:27,731 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:27,732 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,732 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:27,732 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:27,732 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,733 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,733 INFO  L85        PathProgramCache]: Analyzing trace with hash 835713359, now seen corresponding path program 1 times
[2025-04-28 21:21:27,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,736 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374701631]
[2025-04-28 21:21:27,736 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:27,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,742 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:27,749 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:27,749 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:27,750 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:27,831 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:27,831 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:27,832 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374701631]
[2025-04-28 21:21:27,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374701631] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:27,832 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:27,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:27,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338794863]
[2025-04-28 21:21:27,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:27,833 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:27,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:27,834 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:27,834 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:27,834 INFO  L87              Difference]: Start difference. First operand 14 states and 18 transitions. Second operand  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:27,870 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:27,871 INFO  L93              Difference]: Finished difference Result 16 states and 21 transitions.
[2025-04-28 21:21:27,871 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:27,872 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 9
[2025-04-28 21:21:27,872 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:27,872 INFO  L225             Difference]: With dead ends: 16
[2025-04-28 21:21:27,872 INFO  L226             Difference]: Without dead ends: 16
[2025-04-28 21:21:27,873 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:27,874 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:27,874 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:27,875 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2025-04-28 21:21:27,878 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14.
[2025-04-28 21:21:27,878 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:27,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions.
[2025-04-28 21:21:27,879 INFO  L79                 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 9
[2025-04-28 21:21:27,879 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:27,879 INFO  L485      AbstractCegarLoop]: Abstraction has 14 states and 18 transitions.
[2025-04-28 21:21:27,879 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:27,879 INFO  L278                IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions.
[2025-04-28 21:21:27,880 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:27,880 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,880 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:27,881 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:27,881 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,881 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,881 INFO  L85        PathProgramCache]: Analyzing trace with hash -1218053539, now seen corresponding path program 1 times
[2025-04-28 21:21:27,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,882 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680963197]
[2025-04-28 21:21:27,882 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:27,882 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,894 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:27,940 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:27,940 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:27,940 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,180 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:28,180 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:28,180 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680963197]
[2025-04-28 21:21:28,181 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680963197] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:28,181 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782656776]
[2025-04-28 21:21:28,181 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,181 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:28,184 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:28,186 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:28,190 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:28,246 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:28,284 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:28,284 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,284 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,286 INFO  L256         TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:28,293 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:28,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:28,411 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:28,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [782656776] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:28,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:28,412 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8
[2025-04-28 21:21:28,412 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932701779]
[2025-04-28 21:21:28,415 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:28,416 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:28,416 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:28,417 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:28,420 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:28,421 INFO  L87              Difference]: Start difference. First operand 14 states and 18 transitions. Second operand  has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:28,506 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:28,506 INFO  L93              Difference]: Finished difference Result 19 states and 29 transitions.
[2025-04-28 21:21:28,507 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:28,508 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17
[2025-04-28 21:21:28,509 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:28,510 INFO  L225             Difference]: With dead ends: 19
[2025-04-28 21:21:28,510 INFO  L226             Difference]: Without dead ends: 19
[2025-04-28 21:21:28,510 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:28,511 INFO  L437           NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:28,511 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:28,512 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2025-04-28 21:21:28,523 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17.
[2025-04-28 21:21:28,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 9 states have internal predecessors, (9), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10)
[2025-04-28 21:21:28,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions.
[2025-04-28 21:21:28,524 INFO  L79                 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 17
[2025-04-28 21:21:28,524 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:28,524 INFO  L485      AbstractCegarLoop]: Abstraction has 17 states and 24 transitions.
[2025-04-28 21:21:28,524 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:28,525 INFO  L278                IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions.
[2025-04-28 21:21:28,527 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:28,527 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:28,527 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:28,535 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:28,732 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:28,734 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:28,735 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:28,735 INFO  L85        PathProgramCache]: Analyzing trace with hash -2027400165, now seen corresponding path program 1 times
[2025-04-28 21:21:28,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:28,735 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591023278]
[2025-04-28 21:21:28,735 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:28,746 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:28,764 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:28,764 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,764 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,023 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:29,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:29,024 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591023278]
[2025-04-28 21:21:29,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591023278] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:29,024 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503808334]
[2025-04-28 21:21:29,024 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,024 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:29,028 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:29,030 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:29,035 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:29,074 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:29,102 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,103 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,103 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,104 INFO  L256         TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:29,106 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:29,229 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:29,229 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:29,850 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:29,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503808334] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:29,851 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:29,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12
[2025-04-28 21:21:29,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884885898]
[2025-04-28 21:21:29,851 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:29,852 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-04-28 21:21:29,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:29,853 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-04-28 21:21:29,854 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:29,854 INFO  L87              Difference]: Start difference. First operand 17 states and 24 transitions. Second operand  has 12 states, 5 states have (on average 2.4) internal successors, (12), 9 states have internal predecessors, (12), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8)
[2025-04-28 21:21:30,109 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:30,109 INFO  L93              Difference]: Finished difference Result 21 states and 33 transitions.
[2025-04-28 21:21:30,110 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:30,110 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 5 states have (on average 2.4) internal successors, (12), 9 states have internal predecessors, (12), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Word has length 17
[2025-04-28 21:21:30,110 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:30,111 INFO  L225             Difference]: With dead ends: 21
[2025-04-28 21:21:30,111 INFO  L226             Difference]: Without dead ends: 21
[2025-04-28 21:21:30,111 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:30,112 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:30,112 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:30,113 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2025-04-28 21:21:30,120 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19.
[2025-04-28 21:21:30,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19 states, 8 states have (on average 1.25) internal successors, (10), 10 states have internal predecessors, (10), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13)
[2025-04-28 21:21:30,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions.
[2025-04-28 21:21:30,122 INFO  L79                 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 17
[2025-04-28 21:21:30,122 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:30,122 INFO  L485      AbstractCegarLoop]: Abstraction has 19 states and 28 transitions.
[2025-04-28 21:21:30,122 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 5 states have (on average 2.4) internal successors, (12), 9 states have internal predecessors, (12), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8)
[2025-04-28 21:21:30,122 INFO  L278                IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions.
[2025-04-28 21:21:30,123 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:30,123 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,123 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:30,128 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:30,327 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:30,328 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,328 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,328 INFO  L85        PathProgramCache]: Analyzing trace with hash -959888101, now seen corresponding path program 2 times
[2025-04-28 21:21:30,328 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,328 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387226986]
[2025-04-28 21:21:30,329 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:30,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,336 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes.
[2025-04-28 21:21:30,343 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:30,343 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:30,343 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,533 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:30,534 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:30,534 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387226986]
[2025-04-28 21:21:30,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387226986] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:30,534 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933217543]
[2025-04-28 21:21:30,534 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:30,534 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:30,536 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:30,538 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:30,541 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:30,583 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes.
[2025-04-28 21:21:30,600 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:30,600 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:30,601 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,601 INFO  L256         TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:30,603 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:30,758 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:30,758 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:31,326 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,326 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933217543] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:31,326 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:31,326 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17
[2025-04-28 21:21:31,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95630372]
[2025-04-28 21:21:31,327 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,327 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:31,327 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,328 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:31,328 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:31,328 INFO  L87              Difference]: Start difference. First operand 19 states and 28 transitions. Second operand  has 17 states, 8 states have (on average 2.25) internal successors, (18), 13 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10)
[2025-04-28 21:21:31,635 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:31,635 INFO  L93              Difference]: Finished difference Result 24 states and 44 transitions.
[2025-04-28 21:21:31,635 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:31,635 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 8 states have (on average 2.25) internal successors, (18), 13 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Word has length 17
[2025-04-28 21:21:31,636 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:31,637 INFO  L225             Difference]: With dead ends: 24
[2025-04-28 21:21:31,637 INFO  L226             Difference]: Without dead ends: 24
[2025-04-28 21:21:31,637 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:21:31,638 INFO  L437           NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,638 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 112 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:31,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2025-04-28 21:21:31,643 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20.
[2025-04-28 21:21:31,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 8 states have (on average 1.25) internal successors, (10), 10 states have internal predecessors, (10), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17)
[2025-04-28 21:21:31,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions.
[2025-04-28 21:21:31,645 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 33 transitions. Word has length 17
[2025-04-28 21:21:31,645 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,645 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 33 transitions.
[2025-04-28 21:21:31,645 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 8 states have (on average 2.25) internal successors, (18), 13 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10)
[2025-04-28 21:21:31,645 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 33 transitions.
[2025-04-28 21:21:31,646 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:31,646 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,646 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:31,652 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:21:31,850 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:31,851 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,851 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,851 INFO  L85        PathProgramCache]: Analyzing trace with hash -1769234727, now seen corresponding path program 1 times
[2025-04-28 21:21:31,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,855 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853599879]
[2025-04-28 21:21:31,855 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,861 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:31,866 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:31,866 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,867 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:31,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,962 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853599879]
[2025-04-28 21:21:31,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853599879] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:31,962 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130107148]
[2025-04-28 21:21:31,963 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,963 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:31,965 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:31,967 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:31,970 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:32,009 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:32,027 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:32,027 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,027 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,028 INFO  L256         TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:32,031 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:32,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:32,150 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:32,696 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:32,697 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [130107148] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:32,697 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:32,697 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14
[2025-04-28 21:21:32,697 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503686236]
[2025-04-28 21:21:32,697 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:32,698 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-04-28 21:21:32,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:32,699 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-04-28 21:21:32,700 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:32,700 INFO  L87              Difference]: Start difference. First operand 20 states and 33 transitions. Second operand  has 14 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 11 states have internal predecessors, (16), 9 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 9 states have call successors, (10)
[2025-04-28 21:21:33,053 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,053 INFO  L93              Difference]: Finished difference Result 33 states and 63 transitions.
[2025-04-28 21:21:33,054 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:33,054 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 11 states have internal predecessors, (16), 9 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 9 states have call successors, (10) Word has length 17
[2025-04-28 21:21:33,054 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,055 INFO  L225             Difference]: With dead ends: 33
[2025-04-28 21:21:33,057 INFO  L226             Difference]: Without dead ends: 33
[2025-04-28 21:21:33,057 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:33,058 INFO  L437           NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,059 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 95 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:33,059 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2025-04-28 21:21:33,069 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27.
[2025-04-28 21:21:33,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (26), 11 states have call predecessors, (26), 10 states have call successors, (26)
[2025-04-28 21:21:33,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions.
[2025-04-28 21:21:33,071 INFO  L79                 Accepts]: Start accepts. Automaton has 27 states and 49 transitions. Word has length 17
[2025-04-28 21:21:33,071 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,072 INFO  L485      AbstractCegarLoop]: Abstraction has 27 states and 49 transitions.
[2025-04-28 21:21:33,072 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 11 states have internal predecessors, (16), 9 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 9 states have call successors, (10)
[2025-04-28 21:21:33,072 INFO  L278                IsEmpty]: Start isEmpty. Operand 27 states and 49 transitions.
[2025-04-28 21:21:33,073 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:33,073 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,073 INFO  L218           NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,079 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:21:33,274 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,275 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,275 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -1933425433, now seen corresponding path program 3 times
[2025-04-28 21:21:33,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,275 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296390968]
[2025-04-28 21:21:33,275 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:33,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,281 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes.
[2025-04-28 21:21:33,295 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:33,295 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:21:33,295 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-04-28 21:21:33,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,510 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296390968]
[2025-04-28 21:21:33,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296390968] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:33,510 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258020084]
[2025-04-28 21:21:33,510 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:33,510 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,513 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,515 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:33,519 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:33,560 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes.
[2025-04-28 21:21:33,584 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:33,585 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:21:33,585 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,586 INFO  L256         TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:33,587 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:33,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-04-28 21:21:33,674 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:34,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-04-28 21:21:34,027 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [258020084] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:34,027 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:34,027 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15
[2025-04-28 21:21:34,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422539420]
[2025-04-28 21:21:34,028 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,028 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-04-28 21:21:34,028 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,029 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-04-28 21:21:34,029 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:34,029 INFO  L87              Difference]: Start difference. First operand 27 states and 49 transitions. Second operand  has 15 states, 8 states have (on average 2.5) internal successors, (20), 12 states have internal predecessors, (20), 8 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13)
[2025-04-28 21:21:34,216 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,216 INFO  L93              Difference]: Finished difference Result 38 states and 67 transitions.
[2025-04-28 21:21:34,216 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:34,217 INFO  L79                 Accepts]: Start accepts. Automaton has  has 15 states, 8 states have (on average 2.5) internal successors, (20), 12 states have internal predecessors, (20), 8 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 25
[2025-04-28 21:21:34,217 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,218 INFO  L225             Difference]: With dead ends: 38
[2025-04-28 21:21:34,218 INFO  L226             Difference]: Without dead ends: 38
[2025-04-28 21:21:34,218 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:34,219 INFO  L437           NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:34,222 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:34,223 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38 states.
[2025-04-28 21:21:34,232 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32.
[2025-04-28 21:21:34,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (25), 12 states have call predecessors, (25), 11 states have call successors, (25)
[2025-04-28 21:21:34,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions.
[2025-04-28 21:21:34,237 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 53 transitions. Word has length 25
[2025-04-28 21:21:34,237 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,237 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 53 transitions.
[2025-04-28 21:21:34,237 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 8 states have (on average 2.5) internal successors, (20), 12 states have internal predecessors, (20), 8 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13)
[2025-04-28 21:21:34,237 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 53 transitions.
[2025-04-28 21:21:34,240 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:34,240 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,240 INFO  L218           NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:34,246 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-04-28 21:21:34,441 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:34,441 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,442 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,442 INFO  L85        PathProgramCache]: Analyzing trace with hash -513917275, now seen corresponding path program 4 times
[2025-04-28 21:21:34,442 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,442 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262162577]
[2025-04-28 21:21:34,442 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:34,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,447 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:34,453 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:34,453 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:34,453 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-04-28 21:21:34,588 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,588 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262162577]
[2025-04-28 21:21:34,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262162577] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:34,589 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978251985]
[2025-04-28 21:21:34,589 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:34,589 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:34,591 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:34,593 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:34,597 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:34,641 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:34,662 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:34,663 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:34,663 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,664 INFO  L256         TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:34,666 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:34,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-04-28 21:21:34,852 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:36,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:36,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978251985] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:36,235 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:36,235 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 21
[2025-04-28 21:21:36,235 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512855779]
[2025-04-28 21:21:36,235 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,236 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-04-28 21:21:36,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,237 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-04-28 21:21:36,237 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420
[2025-04-28 21:21:36,237 INFO  L87              Difference]: Start difference. First operand 32 states and 53 transitions. Second operand  has 21 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 16 states have internal predecessors, (24), 14 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (16), 9 states have call predecessors, (16), 14 states have call successors, (16)
[2025-04-28 21:21:36,692 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,693 INFO  L93              Difference]: Finished difference Result 42 states and 76 transitions.
[2025-04-28 21:21:36,693 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:36,693 INFO  L79                 Accepts]: Start accepts. Automaton has  has 21 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 16 states have internal predecessors, (24), 14 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (16), 9 states have call predecessors, (16), 14 states have call successors, (16) Word has length 25
[2025-04-28 21:21:36,693 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,695 INFO  L225             Difference]: With dead ends: 42
[2025-04-28 21:21:36,695 INFO  L226             Difference]: Without dead ends: 42
[2025-04-28 21:21:36,695 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812
[2025-04-28 21:21:36,696 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,696 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 136 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:36,700 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2025-04-28 21:21:36,710 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30.
[2025-04-28 21:21:36,713 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19)
[2025-04-28 21:21:36,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 45 transitions.
[2025-04-28 21:21:36,714 INFO  L79                 Accepts]: Start accepts. Automaton has 30 states and 45 transitions. Word has length 25
[2025-04-28 21:21:36,714 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,714 INFO  L485      AbstractCegarLoop]: Abstraction has 30 states and 45 transitions.
[2025-04-28 21:21:36,714 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 16 states have internal predecessors, (24), 14 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (16), 9 states have call predecessors, (16), 14 states have call successors, (16)
[2025-04-28 21:21:36,714 INFO  L278                IsEmpty]: Start isEmpty. Operand 30 states and 45 transitions.
[2025-04-28 21:21:36,716 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:36,716 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,716 INFO  L218           NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:36,724 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:36,919 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:36,920 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,920 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,920 INFO  L85        PathProgramCache]: Analyzing trace with hash 1543893413, now seen corresponding path program 5 times
[2025-04-28 21:21:36,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,920 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675156652]
[2025-04-28 21:21:36,921 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:36,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,929 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 4 equivalence classes.
[2025-04-28 21:21:36,936 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:36,937 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s)
[2025-04-28 21:21:36,937 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:37,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,219 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675156652]
[2025-04-28 21:21:37,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675156652] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:37,219 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489951206]
[2025-04-28 21:21:37,219 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:37,219 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,222 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:37,224 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:37,227 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:37,276 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 4 equivalence classes.
[2025-04-28 21:21:37,299 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:37,300 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s)
[2025-04-28 21:21:37,300 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,301 INFO  L256         TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:37,302 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:37,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-04-28 21:21:37,492 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:38,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:38,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [489951206] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:38,687 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:38,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 24
[2025-04-28 21:21:38,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372889318]
[2025-04-28 21:21:38,689 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:38,689 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-04-28 21:21:38,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:38,690 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-04-28 21:21:38,690 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:21:38,691 INFO  L87              Difference]: Start difference. First operand 30 states and 45 transitions. Second operand  has 24 states, 10 states have (on average 2.2) internal successors, (22), 17 states have internal predecessors, (22), 15 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 15 states have call successors, (16)
[2025-04-28 21:21:38,984 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:38,984 INFO  L93              Difference]: Finished difference Result 44 states and 76 transitions.
[2025-04-28 21:21:38,985 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:38,985 INFO  L79                 Accepts]: Start accepts. Automaton has  has 24 states, 10 states have (on average 2.2) internal successors, (22), 17 states have internal predecessors, (22), 15 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 15 states have call successors, (16) Word has length 25
[2025-04-28 21:21:38,985 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:38,986 INFO  L225             Difference]: With dead ends: 44
[2025-04-28 21:21:38,986 INFO  L226             Difference]: Without dead ends: 44
[2025-04-28 21:21:38,986 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870
[2025-04-28 21:21:38,987 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:38,987 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 141 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:38,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2025-04-28 21:21:38,996 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34.
[2025-04-28 21:21:38,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 34 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (26), 13 states have call predecessors, (26), 11 states have call successors, (26)
[2025-04-28 21:21:39,000 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 54 transitions.
[2025-04-28 21:21:39,000 INFO  L79                 Accepts]: Start accepts. Automaton has 34 states and 54 transitions. Word has length 25
[2025-04-28 21:21:39,000 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,001 INFO  L485      AbstractCegarLoop]: Abstraction has 34 states and 54 transitions.
[2025-04-28 21:21:39,001 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 10 states have (on average 2.2) internal successors, (22), 17 states have internal predecessors, (22), 15 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 15 states have call successors, (16)
[2025-04-28 21:21:39,001 INFO  L278                IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions.
[2025-04-28 21:21:39,004 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-04-28 21:21:39,004 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,004 INFO  L218           NwaCegarLoop]: trace histogram [9, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,013 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:39,204 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-04-28 21:21:39,205 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,205 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -937011333, now seen corresponding path program 6 times
[2025-04-28 21:21:39,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,205 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983386218]
[2025-04-28 21:21:39,205 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-04-28 21:21:39,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,212 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 8 equivalence classes.
[2025-04-28 21:21:39,226 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:39,226 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s)
[2025-04-28 21:21:39,226 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 120 backedges. 6 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked.
[2025-04-28 21:21:39,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,727 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983386218]
[2025-04-28 21:21:39,727 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983386218] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:39,727 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664309709]
[2025-04-28 21:21:39,727 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-04-28 21:21:39,727 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:39,731 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:39,733 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:39,744 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:39,805 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 8 equivalence classes.
[2025-04-28 21:21:39,843 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:39,843 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s)
[2025-04-28 21:21:39,843 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,845 INFO  L256         TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 36 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:39,849 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:40,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked.
[2025-04-28 21:21:40,107 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:43,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-04-28 21:21:43,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [664309709] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:43,400 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:43,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 28
[2025-04-28 21:21:43,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674651503]
[2025-04-28 21:21:43,401 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:43,401 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-04-28 21:21:43,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:43,403 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-04-28 21:21:43,406 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:21:43,407 INFO  L87              Difference]: Start difference. First operand 34 states and 54 transitions. Second operand  has 28 states, 12 states have (on average 2.0) internal successors, (24), 19 states have internal predecessors, (24), 17 states have call successors, (17), 1 states have call predecessors, (17), 11 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22)
[2025-04-28 21:21:43,883 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:43,884 INFO  L93              Difference]: Finished difference Result 58 states and 120 transitions.
[2025-04-28 21:21:43,884 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-04-28 21:21:43,884 INFO  L79                 Accepts]: Start accepts. Automaton has  has 28 states, 12 states have (on average 2.0) internal successors, (24), 19 states have internal predecessors, (24), 17 states have call successors, (17), 1 states have call predecessors, (17), 11 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22) Word has length 41
[2025-04-28 21:21:43,885 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:43,887 INFO  L225             Difference]: With dead ends: 58
[2025-04-28 21:21:43,889 INFO  L226             Difference]: Without dead ends: 58
[2025-04-28 21:21:43,890 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 66 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260
[2025-04-28 21:21:43,891 INFO  L437           NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:43,891 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 156 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:43,891 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2025-04-28 21:21:43,911 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39.
[2025-04-28 21:21:43,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 12 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (36), 16 states have call predecessors, (36), 12 states have call successors, (36)
[2025-04-28 21:21:43,913 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 67 transitions.
[2025-04-28 21:21:43,914 INFO  L79                 Accepts]: Start accepts. Automaton has 39 states and 67 transitions. Word has length 41
[2025-04-28 21:21:43,915 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:43,915 INFO  L485      AbstractCegarLoop]: Abstraction has 39 states and 67 transitions.
[2025-04-28 21:21:43,915 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 12 states have (on average 2.0) internal successors, (24), 19 states have internal predecessors, (24), 17 states have call successors, (17), 1 states have call predecessors, (17), 11 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22)
[2025-04-28 21:21:43,915 INFO  L278                IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions.
[2025-04-28 21:21:43,917 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2025-04-28 21:21:43,917 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:43,917 INFO  L218           NwaCegarLoop]: trace histogram [11, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:43,921 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:44,117 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,117 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:44,118 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:44,118 INFO  L85        PathProgramCache]: Analyzing trace with hash 1635699205, now seen corresponding path program 7 times
[2025-04-28 21:21:44,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:44,118 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016781970]
[2025-04-28 21:21:44,118 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-04-28 21:21:44,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:44,124 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes.
[2025-04-28 21:21:44,136 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements.
[2025-04-28 21:21:44,136 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:44,136 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,328 INFO  L134       CoverageAnalysis]: Checked inductivity of 185 backedges. 52 proven. 58 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-04-28 21:21:44,328 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:44,328 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016781970]
[2025-04-28 21:21:44,328 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016781970] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:44,328 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657719049]
[2025-04-28 21:21:44,328 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-04-28 21:21:44,328 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,331 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:44,333 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:44,336 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:21:44,426 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes.
[2025-04-28 21:21:44,466 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements.
[2025-04-28 21:21:44,466 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:44,466 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,468 INFO  L256         TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:44,470 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:44,619 INFO  L134       CoverageAnalysis]: Checked inductivity of 185 backedges. 54 proven. 50 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-04-28 21:21:44,619 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:45,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 185 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-04-28 21:21:45,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657719049] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:45,184 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:45,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 23
[2025-04-28 21:21:45,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266040973]
[2025-04-28 21:21:45,184 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:45,185 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-04-28 21:21:45,185 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:45,186 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-04-28 21:21:45,186 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:45,186 INFO  L87              Difference]: Start difference. First operand 39 states and 67 transitions. Second operand  has 23 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 21 states have internal predecessors, (31), 15 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (27), 16 states have call predecessors, (27), 15 states have call successors, (27)
[2025-04-28 21:21:45,623 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:45,623 INFO  L93              Difference]: Finished difference Result 48 states and 78 transitions.
[2025-04-28 21:21:45,623 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-04-28 21:21:45,624 INFO  L79                 Accepts]: Start accepts. Automaton has  has 23 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 21 states have internal predecessors, (31), 15 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (27), 16 states have call predecessors, (27), 15 states have call successors, (27) Word has length 49
[2025-04-28 21:21:45,624 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:45,625 INFO  L225             Difference]: With dead ends: 48
[2025-04-28 21:21:45,625 INFO  L226             Difference]: Without dead ends: 40
[2025-04-28 21:21:45,625 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056
[2025-04-28 21:21:45,626 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:45,626 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 124 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:45,627 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2025-04-28 21:21:45,632 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37.
[2025-04-28 21:21:45,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 6 states have call predecessors, (11), 9 states have return successors, (24), 14 states have call predecessors, (24), 11 states have call successors, (24)
[2025-04-28 21:21:45,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions.
[2025-04-28 21:21:45,637 INFO  L79                 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 49
[2025-04-28 21:21:45,637 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:45,638 INFO  L485      AbstractCegarLoop]: Abstraction has 37 states and 54 transitions.
[2025-04-28 21:21:45,638 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 21 states have internal predecessors, (31), 15 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (27), 16 states have call predecessors, (27), 15 states have call successors, (27)
[2025-04-28 21:21:45,638 INFO  L278                IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions.
[2025-04-28 21:21:45,639 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:45,641 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:45,641 INFO  L218           NwaCegarLoop]: trace histogram [15, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:45,647 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-04-28 21:21:45,842 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2025-04-28 21:21:45,842 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:45,842 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:45,842 INFO  L85        PathProgramCache]: Analyzing trace with hash 1556427227, now seen corresponding path program 8 times
[2025-04-28 21:21:45,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:45,842 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492252593]
[2025-04-28 21:21:45,842 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:45,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:45,850 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:45,867 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:45,867 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:45,867 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:46,600 INFO  L134       CoverageAnalysis]: Checked inductivity of 357 backedges. 8 proven. 195 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked.
[2025-04-28 21:21:46,601 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:46,601 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492252593]
[2025-04-28 21:21:46,601 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492252593] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:46,601 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447555428]
[2025-04-28 21:21:46,601 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:46,601 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:46,603 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:46,606 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:46,610 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-04-28 21:21:46,699 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:46,747 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:46,747 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:46,747 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:46,750 INFO  L256         TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 57 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:46,753 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:46,913 INFO  L134       CoverageAnalysis]: Checked inductivity of 357 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked.
[2025-04-28 21:21:46,913 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:56,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 357 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked.
[2025-04-28 21:21:56,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [447555428] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:56,131 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:56,131 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 26
[2025-04-28 21:21:56,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387094007]
[2025-04-28 21:21:56,131 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:56,132 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2025-04-28 21:21:56,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:56,132 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2025-04-28 21:21:56,133 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:21:56,133 INFO  L87              Difference]: Start difference. First operand 37 states and 54 transitions. Second operand  has 26 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 16 states have internal predecessors, (20), 18 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (22), 14 states have call predecessors, (22), 18 states have call successors, (22)
[2025-04-28 21:21:56,601 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:56,601 INFO  L93              Difference]: Finished difference Result 44 states and 74 transitions.
[2025-04-28 21:21:56,602 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:21:56,602 INFO  L79                 Accepts]: Start accepts. Automaton has  has 26 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 16 states have internal predecessors, (20), 18 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (22), 14 states have call predecessors, (22), 18 states have call successors, (22) Word has length 65
[2025-04-28 21:21:56,603 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:56,604 INFO  L225             Difference]: With dead ends: 44
[2025-04-28 21:21:56,605 INFO  L226             Difference]: Without dead ends: 44
[2025-04-28 21:21:56,606 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122
[2025-04-28 21:21:56,606 INFO  L437           NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:56,606 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 174 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:56,607 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2025-04-28 21:21:56,617 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40.
[2025-04-28 21:21:56,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (31), 16 states have call predecessors, (31), 12 states have call successors, (31)
[2025-04-28 21:21:56,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions.
[2025-04-28 21:21:56,621 INFO  L79                 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 65
[2025-04-28 21:21:56,622 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:56,622 INFO  L485      AbstractCegarLoop]: Abstraction has 40 states and 63 transitions.
[2025-04-28 21:21:56,622 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 16 states have internal predecessors, (20), 18 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (22), 14 states have call predecessors, (22), 18 states have call successors, (22)
[2025-04-28 21:21:56,622 INFO  L278                IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions.
[2025-04-28 21:21:56,623 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2025-04-28 21:21:56,623 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:56,623 INFO  L218           NwaCegarLoop]: trace histogram [11, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:56,628 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:56,823 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:56,824 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:56,824 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:56,824 INFO  L85        PathProgramCache]: Analyzing trace with hash 853630853, now seen corresponding path program 9 times
[2025-04-28 21:21:56,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:56,824 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406245606]
[2025-04-28 21:21:56,824 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:56,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:56,831 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 10 equivalence classes.
[2025-04-28 21:21:56,841 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 35 of 49 statements.
[2025-04-28 21:21:56,841 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2025-04-28 21:21:56,841 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:57,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 185 backedges. 63 proven. 45 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2025-04-28 21:21:57,017 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:57,017 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406245606]
[2025-04-28 21:21:57,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406245606] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:57,017 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280043794]
[2025-04-28 21:21:57,017 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:57,017 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:57,020 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:57,022 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:57,025 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-04-28 21:21:57,192 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 10 equivalence classes.
[2025-04-28 21:21:57,223 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 35 of 49 statements.
[2025-04-28 21:21:57,224 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2025-04-28 21:21:57,224 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:57,225 INFO  L256         TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:57,227 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:57,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 185 backedges. 59 proven. 48 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-04-28 21:21:57,331 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:57,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 185 backedges. 59 proven. 49 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2025-04-28 21:21:57,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280043794] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:57,940 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:57,940 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 22
[2025-04-28 21:21:57,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393651870]
[2025-04-28 21:21:57,940 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:57,941 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-04-28 21:21:57,941 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:57,941 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-04-28 21:21:57,942 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:57,942 INFO  L87              Difference]: Start difference. First operand 40 states and 63 transitions. Second operand  has 22 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 19 states have internal predecessors, (29), 15 states have call successors, (20), 1 states have call predecessors, (20), 11 states have return successors, (24), 12 states have call predecessors, (24), 15 states have call successors, (24)
[2025-04-28 21:21:58,349 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:58,349 INFO  L93              Difference]: Finished difference Result 42 states and 73 transitions.
[2025-04-28 21:21:58,349 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:21:58,350 INFO  L79                 Accepts]: Start accepts. Automaton has  has 22 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 19 states have internal predecessors, (29), 15 states have call successors, (20), 1 states have call predecessors, (20), 11 states have return successors, (24), 12 states have call predecessors, (24), 15 states have call successors, (24) Word has length 49
[2025-04-28 21:21:58,350 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:58,351 INFO  L225             Difference]: With dead ends: 42
[2025-04-28 21:21:58,351 INFO  L226             Difference]: Without dead ends: 42
[2025-04-28 21:21:58,352 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812
[2025-04-28 21:21:58,352 INFO  L437           NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:58,353 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 122 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:58,353 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2025-04-28 21:21:58,358 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40.
[2025-04-28 21:21:58,358 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24)
[2025-04-28 21:21:58,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions.
[2025-04-28 21:21:58,359 INFO  L79                 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 49
[2025-04-28 21:21:58,359 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:58,360 INFO  L485      AbstractCegarLoop]: Abstraction has 40 states and 57 transitions.
[2025-04-28 21:21:58,360 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 19 states have internal predecessors, (29), 15 states have call successors, (20), 1 states have call predecessors, (20), 11 states have return successors, (24), 12 states have call predecessors, (24), 15 states have call successors, (24)
[2025-04-28 21:21:58,360 INFO  L278                IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions.
[2025-04-28 21:21:58,361 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-04-28 21:21:58,361 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:58,361 INFO  L218           NwaCegarLoop]: trace histogram [19, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:58,367 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2025-04-28 21:21:58,564 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-04-28 21:21:58,565 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:58,565 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:58,565 INFO  L85        PathProgramCache]: Analyzing trace with hash 1376232241, now seen corresponding path program 10 times
[2025-04-28 21:21:58,565 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:58,565 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219671086]
[2025-04-28 21:21:58,566 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:58,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:58,576 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes.
[2025-04-28 21:21:58,595 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-04-28 21:21:58,597 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:58,597 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:58,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 585 backedges. 117 proven. 151 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked.
[2025-04-28 21:21:58,848 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:58,849 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219671086]
[2025-04-28 21:21:58,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219671086] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:58,849 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442174830]
[2025-04-28 21:21:58,849 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:58,849 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:58,851 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:58,854 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:58,857 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-04-28 21:21:59,014 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes.
[2025-04-28 21:21:59,078 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-04-28 21:21:59,078 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:59,078 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:59,081 INFO  L256         TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 31 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:59,083 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:59,305 INFO  L134       CoverageAnalysis]: Checked inductivity of 585 backedges. 153 proven. 93 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked.
[2025-04-28 21:21:59,305 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
