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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:32,153 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:32,232 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11975b55-341c-423d-9a76-56efa84a1401/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:32,241 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:32,241 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:32,265 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:32,266 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:32,266 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:32,266 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:32,266 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:32,267 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:32,268 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:32,268 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:32,269 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:32,270 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:32,270 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:32,270 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:32,270 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:32,270 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:32,270 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:32,271 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:32,271 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:32,271 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:32,271 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:32,272 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:32,272 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:32,272 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:32,614 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:32,626 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:32,628 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:32,632 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:32,632 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:32,633 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11975b55-341c-423d-9a76-56efa84a1401/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-135.smt2
[2025-04-28 21:21:32,635 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:32,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:32,861 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11975b55-341c-423d-9a76-56efa84a1401/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-135.smt2
[2025-04-28 21:21:32,864 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:32,866 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:32,867 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:32,867 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:32,868 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:32,874 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,901 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32 Unit
[2025-04-28 21:21:32,901 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:32,904 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:32,904 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:32,905 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:32,921 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,921 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,950 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,950 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,954 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,955 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,957 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,959 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,962 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,977 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:32,978 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:32,978 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:32,978 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:32,979 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,984 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:32,998 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,012 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:33,016 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:33,029 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:33,029 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:33,029 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:33,029 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure gib.DLRunknown.CLN4 given in one single declaration
[2025-04-28 21:21:33,030 INFO  L130     BoogieDeclarations]: Found specification of procedure gib.DLRunknown.CLN4
[2025-04-28 21:21:33,030 INFO  L138     BoogieDeclarations]: Found implementation of procedure gib.DLRunknown.CLN4
[2025-04-28 21:21:33,030 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:33,030 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:33,030 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:33,068 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:33,069 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:33,188 INFO  L?                        ?]: Removed 9 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:33,188 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:33,200 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:33,200 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:33,201 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:33 BoogieIcfgContainer
[2025-04-28 21:21:33,201 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:33,204 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:33,204 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:33,209 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:33,209 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:32" (1/3) ...
[2025-04-28 21:21:33,210 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3405214d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:33, skipping insertion in model container
[2025-04-28 21:21:33,210 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (2/3) ...
[2025-04-28 21:21:33,211 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3405214d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:33, skipping insertion in model container
[2025-04-28 21:21:33,211 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:33" (3/3) ...
[2025-04-28 21:21:33,213 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:33,228 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:33,230 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:33,270 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:33,283 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;@33fd678, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:33,283 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:33,287 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:33,297 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:33,298 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,298 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,299 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,307 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,309 INFO  L85        PathProgramCache]: Analyzing trace with hash 778455057, now seen corresponding path program 1 times
[2025-04-28 21:21:33,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,318 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581984373]
[2025-04-28 21:21:33,318 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,359 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:33,382 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:33,383 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,383 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:33,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,551 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581984373]
[2025-04-28 21:21:33,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581984373] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:33,552 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:33,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:33,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011561740]
[2025-04-28 21:21:33,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,560 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:33,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,586 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:33,587 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:33,589 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:33,661 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,661 INFO  L93              Difference]: Finished difference Result 14 states and 18 transitions.
[2025-04-28 21:21:33,663 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:33,665 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 9
[2025-04-28 21:21:33,665 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,675 INFO  L225             Difference]: With dead ends: 14
[2025-04-28 21:21:33,676 INFO  L226             Difference]: Without dead ends: 14
[2025-04-28 21:21:33,678 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:33,684 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.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,685 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.1s Time]
[2025-04-28 21:21:33,699 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2025-04-28 21:21:33,723 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2025-04-28 21:21:33,724 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:33,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions.
[2025-04-28 21:21:33,734 INFO  L79                 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 9
[2025-04-28 21:21:33,734 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,734 INFO  L485      AbstractCegarLoop]: Abstraction has 14 states and 18 transitions.
[2025-04-28 21:21:33,735 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:33,735 INFO  L278                IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions.
[2025-04-28 21:21:33,737 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:33,737 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,737 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,738 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:33,738 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,738 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,740 INFO  L85        PathProgramCache]: Analyzing trace with hash 835713359, now seen corresponding path program 1 times
[2025-04-28 21:21:33,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,740 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750865690]
[2025-04-28 21:21:33,740 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,749 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:33,766 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:33,766 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,766 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,914 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:33,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,914 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750865690]
[2025-04-28 21:21:33,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750865690] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:33,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:33,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:33,915 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978068591]
[2025-04-28 21:21:33,915 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,916 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:33,916 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,916 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:33,916 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:33,917 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:33,963 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,963 INFO  L93              Difference]: Finished difference Result 16 states and 21 transitions.
[2025-04-28 21:21:33,965 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:33,965 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 9
[2025-04-28 21:21:33,965 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,966 INFO  L225             Difference]: With dead ends: 16
[2025-04-28 21:21:33,966 INFO  L226             Difference]: Without dead ends: 16
[2025-04-28 21:21:33,966 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:33,967 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:33,967 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:33,971 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2025-04-28 21:21:33,973 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14.
[2025-04-28 21:21:33,974 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:33,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions.
[2025-04-28 21:21:33,976 INFO  L79                 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 9
[2025-04-28 21:21:33,976 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,977 INFO  L485      AbstractCegarLoop]: Abstraction has 14 states and 18 transitions.
[2025-04-28 21:21:33,977 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:33,977 INFO  L278                IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions.
[2025-04-28 21:21:33,979 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:33,979 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,979 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,980 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:33,980 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,980 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,980 INFO  L85        PathProgramCache]: Analyzing trace with hash -1218053539, now seen corresponding path program 1 times
[2025-04-28 21:21:33,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,981 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364007571]
[2025-04-28 21:21:33,981 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,995 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:34,014 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:34,014 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,014 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,210 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:34,210 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,210 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364007571]
[2025-04-28 21:21:34,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364007571] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:34,210 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950169444]
[2025-04-28 21:21:34,210 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,211 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:34,215 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:34,219 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:34,220 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:34,282 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:34,307 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:34,307 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,307 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,309 INFO  L256         TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:34,314 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:34,503 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:34,504 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:34,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [950169444] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:34,504 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:34,504 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8
[2025-04-28 21:21:34,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176355767]
[2025-04-28 21:21:34,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,505 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:34,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,506 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:34,506 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:34,506 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:34,586 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,586 INFO  L93              Difference]: Finished difference Result 19 states and 29 transitions.
[2025-04-28 21:21:34,588 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:34,588 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:34,588 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,589 INFO  L225             Difference]: With dead ends: 19
[2025-04-28 21:21:34,589 INFO  L226             Difference]: Without dead ends: 19
[2025-04-28 21:21:34,590 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:34,591 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:34,591 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:34,592 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2025-04-28 21:21:34,598 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17.
[2025-04-28 21:21:34,598 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:34,599 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions.
[2025-04-28 21:21:34,599 INFO  L79                 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 17
[2025-04-28 21:21:34,599 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,599 INFO  L485      AbstractCegarLoop]: Abstraction has 17 states and 24 transitions.
[2025-04-28 21:21:34,600 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:34,600 INFO  L278                IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions.
[2025-04-28 21:21:34,600 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:34,601 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,601 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:34,607 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:34,801 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:34,802 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,802 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,803 INFO  L85        PathProgramCache]: Analyzing trace with hash -2027400165, now seen corresponding path program 1 times
[2025-04-28 21:21:34,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,803 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213493405]
[2025-04-28 21:21:34,803 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,810 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:34,817 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:34,817 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,817 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,049 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:35,050 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:35,050 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213493405]
[2025-04-28 21:21:35,050 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213493405] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:35,050 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483771276]
[2025-04-28 21:21:35,050 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:35,050 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:35,054 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:35,056 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:35,059 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:35,092 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:35,115 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:35,115 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,116 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,117 INFO  L256         TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:35,119 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:35,262 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:35,262 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:35,950 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:35,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [483771276] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:35,951 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:35,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11
[2025-04-28 21:21:35,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896600002]
[2025-04-28 21:21:35,952 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:35,952 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-04-28 21:21:35,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:35,953 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-04-28 21:21:35,953 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:35,953 INFO  L87              Difference]: Start difference. First operand 17 states and 24 transitions. Second operand  has 11 states, 5 states have (on average 2.2) internal successors, (11), 8 states have internal predecessors, (11), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7)
[2025-04-28 21:21:36,147 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,147 INFO  L93              Difference]: Finished difference Result 21 states and 33 transitions.
[2025-04-28 21:21:36,151 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:36,151 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 5 states have (on average 2.2) internal successors, (11), 8 states have internal predecessors, (11), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) Word has length 17
[2025-04-28 21:21:36,152 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,152 INFO  L225             Difference]: With dead ends: 21
[2025-04-28 21:21:36,152 INFO  L226             Difference]: Without dead ends: 21
[2025-04-28 21:21:36,153 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:36,154 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,154 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 64 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:36,155 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2025-04-28 21:21:36,163 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19.
[2025-04-28 21:21:36,163 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:36,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions.
[2025-04-28 21:21:36,166 INFO  L79                 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 17
[2025-04-28 21:21:36,166 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,166 INFO  L485      AbstractCegarLoop]: Abstraction has 19 states and 28 transitions.
[2025-04-28 21:21:36,167 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 5 states have (on average 2.2) internal successors, (11), 8 states have internal predecessors, (11), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7)
[2025-04-28 21:21:36,167 INFO  L278                IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions.
[2025-04-28 21:21:36,167 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:36,168 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,168 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:36,174 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:36,373 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:36,373 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,374 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,374 INFO  L85        PathProgramCache]: Analyzing trace with hash -959888101, now seen corresponding path program 2 times
[2025-04-28 21:21:36,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,374 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482558728]
[2025-04-28 21:21:36,374 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:36,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,381 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes.
[2025-04-28 21:21:36,388 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:36,388 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:36,388 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,554 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:36,554 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,554 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482558728]
[2025-04-28 21:21:36,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482558728] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:36,555 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306393129]
[2025-04-28 21:21:36,555 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:36,555 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:36,557 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:36,560 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:36,563 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:36,605 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes.
[2025-04-28 21:21:36,623 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:36,623 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:36,623 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,624 INFO  L256         TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:36,626 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:36,745 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:36,745 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:37,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:37,326 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306393129] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:37,326 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:37,326 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13
[2025-04-28 21:21:37,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306133381]
[2025-04-28 21:21:37,327 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,327 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:37,327 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,331 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:37,331 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:37,332 INFO  L87              Difference]: Start difference. First operand 19 states and 28 transitions. Second operand  has 13 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9)
[2025-04-28 21:21:37,516 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,517 INFO  L93              Difference]: Finished difference Result 24 states and 44 transitions.
[2025-04-28 21:21:37,517 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:37,518 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) Word has length 17
[2025-04-28 21:21:37,518 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,519 INFO  L225             Difference]: With dead ends: 24
[2025-04-28 21:21:37,522 INFO  L226             Difference]: Without dead ends: 24
[2025-04-28 21:21:37,523 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:37,523 INFO  L437           NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,524 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 79 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:37,524 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2025-04-28 21:21:37,534 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20.
[2025-04-28 21:21:37,535 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:37,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions.
[2025-04-28 21:21:37,536 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 33 transitions. Word has length 17
[2025-04-28 21:21:37,537 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:37,537 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 33 transitions.
[2025-04-28 21:21:37,537 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9)
[2025-04-28 21:21:37,537 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 33 transitions.
[2025-04-28 21:21:37,538 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:37,540 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:37,540 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:37,546 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:21:37,741 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:37,741 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:37,741 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:37,742 INFO  L85        PathProgramCache]: Analyzing trace with hash -1769234727, now seen corresponding path program 1 times
[2025-04-28 21:21:37,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:37,742 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643551301]
[2025-04-28 21:21:37,742 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,750 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:37,756 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:37,757 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,757 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,829 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:37,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,829 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643551301]
[2025-04-28 21:21:37,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643551301] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:37,830 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594433218]
[2025-04-28 21:21:37,830 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,830 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,855 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:37,858 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:37,862 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:37,899 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:37,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:37,913 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,913 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,914 INFO  L256         TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:37,916 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:37,951 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:37,951 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:37,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594433218] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:37,952 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:37,952 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8
[2025-04-28 21:21:37,952 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848834885]
[2025-04-28 21:21:37,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,952 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:37,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,953 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:37,953 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:37,953 INFO  L87              Difference]: Start difference. First operand 20 states and 33 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:37,998 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,999 INFO  L93              Difference]: Finished difference Result 24 states and 43 transitions.
[2025-04-28 21:21:37,999 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:37,999 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:37,999 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:38,000 INFO  L225             Difference]: With dead ends: 24
[2025-04-28 21:21:38,000 INFO  L226             Difference]: Without dead ends: 24
[2025-04-28 21:21:38,001 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:38,001 INFO  L437           NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:38,002 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 67 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:38,002 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2025-04-28 21:21:38,014 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20.
[2025-04-28 21:21:38,014 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, (16), 7 states have call predecessors, (16), 6 states have call successors, (16)
[2025-04-28 21:21:38,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions.
[2025-04-28 21:21:38,015 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 32 transitions. Word has length 17
[2025-04-28 21:21:38,015 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,015 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 32 transitions.
[2025-04-28 21:21:38,016 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:38,016 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions.
[2025-04-28 21:21:38,016 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:38,016 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,017 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:38,022 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:38,219 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:38,219 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,219 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,219 INFO  L85        PathProgramCache]: Analyzing trace with hash 1543893413, now seen corresponding path program 3 times
[2025-04-28 21:21:38,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,220 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005073180]
[2025-04-28 21:21:38,220 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:38,220 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,225 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes.
[2025-04-28 21:21:38,237 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:38,240 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:21:38,240 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-04-28 21:21:38,580 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:38,580 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005073180]
[2025-04-28 21:21:38,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005073180] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:38,581 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682030884]
[2025-04-28 21:21:38,581 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:38,581 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:38,583 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:38,585 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:38,588 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:38,628 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes.
[2025-04-28 21:21:38,652 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:38,652 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:21:38,652 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,654 INFO  L256         TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:38,656 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:38,783 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:38,783 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:40,169 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:40,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [682030884] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:40,170 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:40,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 17
[2025-04-28 21:21:40,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948937721]
[2025-04-28 21:21:40,170 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,171 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:40,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,171 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:40,172 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:40,172 INFO  L87              Difference]: Start difference. First operand 20 states and 32 transitions. Second operand  has 17 states, 8 states have (on average 2.125) internal successors, (17), 12 states have internal predecessors, (17), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13)
[2025-04-28 21:21:40,537 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,537 INFO  L93              Difference]: Finished difference Result 28 states and 54 transitions.
[2025-04-28 21:21:40,537 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:40,538 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 8 states have (on average 2.125) internal successors, (17), 12 states have internal predecessors, (17), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Word has length 25
[2025-04-28 21:21:40,538 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,539 INFO  L225             Difference]: With dead ends: 28
[2025-04-28 21:21:40,539 INFO  L226             Difference]: Without dead ends: 28
[2025-04-28 21:21:40,539 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:40,540 INFO  L437           NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,540 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 105 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:40,541 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2025-04-28 21:21:40,549 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22.
[2025-04-28 21:21:40,549 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (20), 8 states have call predecessors, (20), 6 states have call successors, (20)
[2025-04-28 21:21:40,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions.
[2025-04-28 21:21:40,550 INFO  L79                 Accepts]: Start accepts. Automaton has 22 states and 37 transitions. Word has length 25
[2025-04-28 21:21:40,550 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,550 INFO  L485      AbstractCegarLoop]: Abstraction has 22 states and 37 transitions.
[2025-04-28 21:21:40,551 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 8 states have (on average 2.125) internal successors, (17), 12 states have internal predecessors, (17), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13)
[2025-04-28 21:21:40,551 INFO  L278                IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions.
[2025-04-28 21:21:40,552 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:40,552 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,552 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:40,559 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:40,758 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:40,758 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,759 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -1933425433, now seen corresponding path program 4 times
[2025-04-28 21:21:40,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,760 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661735697]
[2025-04-28 21:21:40,760 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:40,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,766 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:40,774 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:40,774 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:40,774 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,894 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:40,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,895 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661735697]
[2025-04-28 21:21:40,895 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661735697] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:40,895 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733314809]
[2025-04-28 21:21:40,895 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:40,895 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:40,898 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:40,900 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:40,903 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:40,956 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:40,979 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:40,979 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:40,979 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,981 INFO  L256         TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:40,982 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:41,094 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:41,096 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:41,477 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:41,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [733314809] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:41,479 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:41,479 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16
[2025-04-28 21:21:41,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437605624]
[2025-04-28 21:21:41,479 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:41,480 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-04-28 21:21:41,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:41,481 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-04-28 21:21:41,481 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:41,482 INFO  L87              Difference]: Start difference. First operand 22 states and 37 transitions. Second operand  has 16 states, 8 states have (on average 2.75) internal successors, (22), 13 states have internal predecessors, (22), 10 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14)
[2025-04-28 21:21:41,723 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:41,723 INFO  L93              Difference]: Finished difference Result 29 states and 52 transitions.
[2025-04-28 21:21:41,723 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:41,724 INFO  L79                 Accepts]: Start accepts. Automaton has  has 16 states, 8 states have (on average 2.75) internal successors, (22), 13 states have internal predecessors, (22), 10 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) Word has length 25
[2025-04-28 21:21:41,724 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:41,725 INFO  L225             Difference]: With dead ends: 29
[2025-04-28 21:21:41,725 INFO  L226             Difference]: Without dead ends: 29
[2025-04-28 21:21:41,726 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:21:41,726 INFO  L437           NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:41,727 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 108 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:41,727 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2025-04-28 21:21:41,739 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25.
[2025-04-28 21:21:41,750 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (17), 9 states have call predecessors, (17), 6 states have call successors, (17)
[2025-04-28 21:21:41,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions.
[2025-04-28 21:21:41,753 INFO  L79                 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 25
[2025-04-28 21:21:41,753 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:41,753 INFO  L485      AbstractCegarLoop]: Abstraction has 25 states and 36 transitions.
[2025-04-28 21:21:41,754 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 8 states have (on average 2.75) internal successors, (22), 13 states have internal predecessors, (22), 10 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14)
[2025-04-28 21:21:41,756 INFO  L278                IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions.
[2025-04-28 21:21:41,756 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:41,757 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:41,757 INFO  L218           NwaCegarLoop]: trace histogram [7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:41,764 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-04-28 21:21:41,957 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:41,957 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:41,958 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:41,958 INFO  L85        PathProgramCache]: Analyzing trace with hash -1726689361, now seen corresponding path program 5 times
[2025-04-28 21:21:41,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:41,958 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894428381]
[2025-04-28 21:21:41,958 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:41,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:41,965 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 6 equivalence classes.
[2025-04-28 21:21:41,971 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 24 of 33 statements.
[2025-04-28 21:21:41,971 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s)
[2025-04-28 21:21:41,971 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:42,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 69 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-04-28 21:21:42,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:42,075 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894428381]
[2025-04-28 21:21:42,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894428381] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:42,075 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607130399]
[2025-04-28 21:21:42,075 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:42,076 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:42,078 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:42,080 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:42,084 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:42,132 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 6 equivalence classes.
[2025-04-28 21:21:42,156 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 24 of 33 statements.
[2025-04-28 21:21:42,157 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s)
[2025-04-28 21:21:42,157 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:42,158 INFO  L256         TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 21 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:42,160 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:42,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 69 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-04-28 21:21:42,295 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:42,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 69 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-04-28 21:21:42,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [607130399] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:42,693 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:42,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 17
[2025-04-28 21:21:42,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188761408]
[2025-04-28 21:21:42,693 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:42,694 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:42,694 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:42,694 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:42,695 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:42,695 INFO  L87              Difference]: Start difference. First operand 25 states and 36 transitions. Second operand  has 17 states, 8 states have (on average 3.0) internal successors, (24), 14 states have internal predecessors, (24), 12 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (17), 9 states have call predecessors, (17), 12 states have call successors, (17)
[2025-04-28 21:21:42,960 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:42,960 INFO  L93              Difference]: Finished difference Result 27 states and 39 transitions.
[2025-04-28 21:21:42,961 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:42,961 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 8 states have (on average 3.0) internal successors, (24), 14 states have internal predecessors, (24), 12 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (17), 9 states have call predecessors, (17), 12 states have call successors, (17) Word has length 33
[2025-04-28 21:21:42,961 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:42,962 INFO  L225             Difference]: With dead ends: 27
[2025-04-28 21:21:42,962 INFO  L226             Difference]: Without dead ends: 27
[2025-04-28 21:21:42,963 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600
[2025-04-28 21:21:42,963 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:42,964 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:42,964 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2025-04-28 21:21:42,968 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24.
[2025-04-28 21:21:42,968 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11)
[2025-04-28 21:21:42,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions.
[2025-04-28 21:21:42,969 INFO  L79                 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 33
[2025-04-28 21:21:42,969 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:42,969 INFO  L485      AbstractCegarLoop]: Abstraction has 24 states and 30 transitions.
[2025-04-28 21:21:42,970 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 8 states have (on average 3.0) internal successors, (24), 14 states have internal predecessors, (24), 12 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (17), 9 states have call predecessors, (17), 12 states have call successors, (17)
[2025-04-28 21:21:42,973 INFO  L278                IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions.
[2025-04-28 21:21:42,974 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-04-28 21:21:42,974 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:42,975 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:42,981 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-04-28 21:21:43,175 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:43,175 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:43,176 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:43,176 INFO  L85        PathProgramCache]: Analyzing trace with hash -937011333, now seen corresponding path program 6 times
[2025-04-28 21:21:43,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:43,176 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053306444]
[2025-04-28 21:21:43,176 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-04-28 21:21:43,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:43,183 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 8 equivalence classes.
[2025-04-28 21:21:43,198 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:43,198 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s)
[2025-04-28 21:21:43,198 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:43,656 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:43,656 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:43,657 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053306444]
[2025-04-28 21:21:43,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053306444] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:43,657 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28658693]
[2025-04-28 21:21:43,657 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-04-28 21:21:43,657 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:43,660 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:43,662 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:43,665 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:43,719 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 8 equivalence classes.
[2025-04-28 21:21:43,760 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:43,760 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s)
[2025-04-28 21:21:43,760 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:43,762 INFO  L256         TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 38 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:43,772 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:43,912 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:43,912 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:47,215 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:47,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [28658693] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:47,215 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:47,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 21
[2025-04-28 21:21:47,215 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625186121]
[2025-04-28 21:21:47,215 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:47,216 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-04-28 21:21:47,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:47,217 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-04-28 21:21:47,217 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420
[2025-04-28 21:21:47,217 INFO  L87              Difference]: Start difference. First operand 24 states and 30 transitions. Second operand  has 21 states, 9 states have (on average 2.111111111111111) internal successors, (19), 14 states have internal predecessors, (19), 13 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (18), 10 states have call predecessors, (18), 13 states have call successors, (18)
[2025-04-28 21:21:47,491 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:47,492 INFO  L93              Difference]: Finished difference Result 29 states and 42 transitions.
[2025-04-28 21:21:47,492 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:47,493 INFO  L79                 Accepts]: Start accepts. Automaton has  has 21 states, 9 states have (on average 2.111111111111111) internal successors, (19), 14 states have internal predecessors, (19), 13 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (18), 10 states have call predecessors, (18), 13 states have call successors, (18) Word has length 41
[2025-04-28 21:21:47,493 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:47,494 INFO  L225             Difference]: With dead ends: 29
[2025-04-28 21:21:47,494 INFO  L226             Difference]: Without dead ends: 29
[2025-04-28 21:21:47,494 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702
[2025-04-28 21:21:47,495 INFO  L437           NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:47,495 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 127 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:47,496 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2025-04-28 21:21:47,499 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27.
[2025-04-28 21:21:47,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (16), 10 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:47,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions.
[2025-04-28 21:21:47,500 INFO  L79                 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 41
[2025-04-28 21:21:47,501 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:47,501 INFO  L485      AbstractCegarLoop]: Abstraction has 27 states and 37 transitions.
[2025-04-28 21:21:47,501 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 9 states have (on average 2.111111111111111) internal successors, (19), 14 states have internal predecessors, (19), 13 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (18), 10 states have call predecessors, (18), 13 states have call successors, (18)
[2025-04-28 21:21:47,501 INFO  L278                IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions.
[2025-04-28 21:21:47,502 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2025-04-28 21:21:47,502 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:47,502 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:47,508 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:47,703 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:47,703 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:47,703 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:47,703 INFO  L85        PathProgramCache]: Analyzing trace with hash 853630853, now seen corresponding path program 7 times
[2025-04-28 21:21:47,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:47,704 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151814680]
[2025-04-28 21:21:47,704 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-04-28 21:21:47,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:47,709 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes.
[2025-04-28 21:21:47,717 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements.
[2025-04-28 21:21:47,717 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:47,717 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 185 backedges. 49 proven. 49 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked.
[2025-04-28 21:21:47,891 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:47,891 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151814680]
[2025-04-28 21:21:47,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151814680] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:47,892 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120480843]
[2025-04-28 21:21:47,892 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-04-28 21:21:47,892 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:47,894 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:47,896 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:47,900 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:21:47,974 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes.
[2025-04-28 21:21:48,013 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements.
[2025-04-28 21:21:48,014 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:48,014 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:48,015 INFO  L256         TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 28 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:48,018 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:48,152 INFO  L134       CoverageAnalysis]: Checked inductivity of 185 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2025-04-28 21:21:48,152 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:48,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 185 backedges. 55 proven. 57 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked.
[2025-04-28 21:21:48,881 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [120480843] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:48,881 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:48,881 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 22
[2025-04-28 21:21:48,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439838443]
[2025-04-28 21:21:48,882 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:48,882 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-04-28 21:21:48,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:48,883 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-04-28 21:21:48,883 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:48,884 INFO  L87              Difference]: Start difference. First operand 27 states and 37 transitions. Second operand  has 22 states, 10 states have (on average 2.9) internal successors, (29), 19 states have internal predecessors, (29), 16 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (24), 12 states have call predecessors, (24), 16 states have call successors, (24)
[2025-04-28 21:21:49,216 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:49,216 INFO  L93              Difference]: Finished difference Result 39 states and 73 transitions.
[2025-04-28 21:21:49,217 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:21:49,218 INFO  L79                 Accepts]: Start accepts. Automaton has  has 22 states, 10 states have (on average 2.9) internal successors, (29), 19 states have internal predecessors, (29), 16 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (24), 12 states have call predecessors, (24), 16 states have call successors, (24) Word has length 49
[2025-04-28 21:21:49,218 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:49,219 INFO  L225             Difference]: With dead ends: 39
[2025-04-28 21:21:49,219 INFO  L226             Difference]: Without dead ends: 39
[2025-04-28 21:21:49,219 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812
[2025-04-28 21:21:49,220 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:49,221 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 104 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:49,222 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2025-04-28 21:21:49,235 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36.
[2025-04-28 21:21:49,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 15 states have internal predecessors, (20), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (27), 12 states have call predecessors, (27), 10 states have call successors, (27)
[2025-04-28 21:21:49,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 57 transitions.
[2025-04-28 21:21:49,239 INFO  L79                 Accepts]: Start accepts. Automaton has 36 states and 57 transitions. Word has length 49
[2025-04-28 21:21:49,240 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:49,240 INFO  L485      AbstractCegarLoop]: Abstraction has 36 states and 57 transitions.
[2025-04-28 21:21:49,240 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 10 states have (on average 2.9) internal successors, (29), 19 states have internal predecessors, (29), 16 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (24), 12 states have call predecessors, (24), 16 states have call successors, (24)
[2025-04-28 21:21:49,240 INFO  L278                IsEmpty]: Start isEmpty. Operand 36 states and 57 transitions.
[2025-04-28 21:21:49,241 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2025-04-28 21:21:49,241 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:49,241 INFO  L218           NwaCegarLoop]: trace histogram [13, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:49,249 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-04-28 21:21:49,445 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:49,445 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:49,446 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:49,446 INFO  L85        PathProgramCache]: Analyzing trace with hash 1383562705, now seen corresponding path program 8 times
[2025-04-28 21:21:49,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:49,446 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727323637]
[2025-04-28 21:21:49,446 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:49,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:49,456 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes.
[2025-04-28 21:21:49,470 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements.
[2025-04-28 21:21:49,470 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:49,470 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 88 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked.
[2025-04-28 21:21:49,664 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:49,665 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727323637]
[2025-04-28 21:21:49,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727323637] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:49,665 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729602977]
[2025-04-28 21:21:49,665 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:49,665 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:49,667 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:49,670 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:49,676 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-04-28 21:21:49,761 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes.
[2025-04-28 21:21:49,803 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements.
[2025-04-28 21:21:49,803 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:49,803 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,806 INFO  L256         TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 30 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:49,807 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:50,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 264 backedges. 69 proven. 73 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked.
[2025-04-28 21:21:50,010 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:50,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 264 backedges. 65 proven. 77 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked.
[2025-04-28 21:21:50,727 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [729602977] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:50,727 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:50,727 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 26
[2025-04-28 21:21:50,727 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990251303]
[2025-04-28 21:21:50,727 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:50,728 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2025-04-28 21:21:50,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:50,728 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2025-04-28 21:21:50,729 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:21:50,729 INFO  L87              Difference]: Start difference. First operand 36 states and 57 transitions. Second operand  has 26 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 22 states have internal predecessors, (32), 20 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (27), 14 states have call predecessors, (27), 20 states have call successors, (27)
[2025-04-28 21:21:51,055 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,056 INFO  L93              Difference]: Finished difference Result 40 states and 66 transitions.
[2025-04-28 21:21:51,060 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-04-28 21:21:51,060 INFO  L79                 Accepts]: Start accepts. Automaton has  has 26 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 22 states have internal predecessors, (32), 20 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (27), 14 states have call predecessors, (27), 20 states have call successors, (27) Word has length 57
[2025-04-28 21:21:51,061 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,061 INFO  L225             Difference]: With dead ends: 40
[2025-04-28 21:21:51,062 INFO  L226             Difference]: Without dead ends: 40
[2025-04-28 21:21:51,062 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992
[2025-04-28 21:21:51,063 INFO  L437           NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,063 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 162 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:51,064 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2025-04-28 21:21:51,068 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35.
[2025-04-28 21:21:51,068 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19)
[2025-04-28 21:21:51,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions.
[2025-04-28 21:21:51,069 INFO  L79                 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 57
[2025-04-28 21:21:51,069 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,069 INFO  L485      AbstractCegarLoop]: Abstraction has 35 states and 49 transitions.
[2025-04-28 21:21:51,070 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 22 states have internal predecessors, (32), 20 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (27), 14 states have call predecessors, (27), 20 states have call successors, (27)
[2025-04-28 21:21:51,070 INFO  L278                IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions.
[2025-04-28 21:21:51,071 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:51,071 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,071 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:51,076 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2025-04-28 21:21:51,275 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:51,275 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,276 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,276 INFO  L85        PathProgramCache]: Analyzing trace with hash 1556427227, now seen corresponding path program 9 times
[2025-04-28 21:21:51,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,276 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340085706]
[2025-04-28 21:21:51,276 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:51,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,282 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 15 equivalence classes.
[2025-04-28 21:21:51,309 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 63 of 65 statements.
[2025-04-28 21:21:51,309 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s)
[2025-04-28 21:21:51,309 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:52,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 357 backedges. 16 proven. 193 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked.
[2025-04-28 21:21:52,033 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:52,033 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340085706]
[2025-04-28 21:21:52,033 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340085706] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:52,033 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823002459]
[2025-04-28 21:21:52,033 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:52,033 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:52,036 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:52,037 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:52,040 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-04-28 21:21:52,123 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 15 equivalence classes.
[2025-04-28 21:21:52,184 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 63 of 65 statements.
[2025-04-28 21:21:52,184 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s)
[2025-04-28 21:21:52,184 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:52,188 INFO  L256         TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 59 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:52,190 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:52,353 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:52,354 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:01,290 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:22:01,290 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [823002459] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:01,290 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:01,290 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 25
[2025-04-28 21:22:01,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248474549]
[2025-04-28 21:22:01,290 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:01,291 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2025-04-28 21:22:01,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:01,292 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2025-04-28 21:22:01,292 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600
[2025-04-28 21:22:01,292 INFO  L87              Difference]: Start difference. First operand 35 states and 49 transitions. Second operand  has 25 states, 10 states have (on average 2.1) internal successors, (21), 16 states have internal predecessors, (21), 16 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (22), 13 states have call predecessors, (22), 16 states have call successors, (22)
[2025-04-28 21:22:01,646 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:01,647 INFO  L93              Difference]: Finished difference Result 37 states and 53 transitions.
[2025-04-28 21:22:01,647 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:22:01,647 INFO  L79                 Accepts]: Start accepts. Automaton has  has 25 states, 10 states have (on average 2.1) internal successors, (21), 16 states have internal predecessors, (21), 16 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (22), 13 states have call predecessors, (22), 16 states have call successors, (22) Word has length 65
[2025-04-28 21:22:01,648 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:01,648 INFO  L225             Difference]: With dead ends: 37
[2025-04-28 21:22:01,648 INFO  L226             Difference]: Without dead ends: 37
[2025-04-28 21:22:01,649 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 16 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056
[2025-04-28 21:22:01,649 INFO  L437           NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:01,650 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 119 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:22:01,650 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2025-04-28 21:22:01,654 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37.
[2025-04-28 21:22:01,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (22), 12 states have call predecessors, (22), 11 states have call successors, (22)
[2025-04-28 21:22:01,655 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions.
[2025-04-28 21:22:01,655 INFO  L79                 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 65
[2025-04-28 21:22:01,655 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:01,655 INFO  L485      AbstractCegarLoop]: Abstraction has 37 states and 53 transitions.
[2025-04-28 21:22:01,656 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 10 states have (on average 2.1) internal successors, (21), 16 states have internal predecessors, (21), 16 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (22), 13 states have call predecessors, (22), 16 states have call successors, (22)
[2025-04-28 21:22:01,656 INFO  L278                IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions.
[2025-04-28 21:22:01,658 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-04-28 21:22:01,658 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:01,659 INFO  L218           NwaCegarLoop]: trace histogram [25, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:01,666 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2025-04-28 21:22:01,859 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:22:01,859 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:01,859 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:01,860 INFO  L85        PathProgramCache]: Analyzing trace with hash 333124241, now seen corresponding path program 10 times
[2025-04-28 21:22:01,860 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:01,860 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706362299]
[2025-04-28 21:22:01,860 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:22:01,860 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:01,871 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 105 statements into 2 equivalence classes.
[2025-04-28 21:22:01,897 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-04-28 21:22:01,897 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:22:01,897 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:03,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 1032 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked.
[2025-04-28 21:22:03,323 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:03,323 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706362299]
[2025-04-28 21:22:03,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706362299] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:03,324 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7506371]
[2025-04-28 21:22:03,324 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:22:03,324 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:03,326 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:03,328 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:22:03,331 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-04-28 21:22:03,493 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 105 statements into 2 equivalence classes.
[2025-04-28 21:22:03,573 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-04-28 21:22:03,573 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:22:03,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:03,577 INFO  L256         TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 94 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:03,581 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:03,793 INFO  L134       CoverageAnalysis]: Checked inductivity of 1032 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked.
[2025-04-28 21:22:03,793 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
