./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/hcai-bench/svcomp/O0/O0_recHanoi01_true-unreach-call_true-no-overflow_true-termination_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:25:58,748 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:25:58,786 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0390f613-4598-4e1c-a121-a81379436de1/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:25:58,789 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:25:58,789 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:25:58,802 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:25:58,802 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:25:58,802 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:25:58,803 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:25:58,803 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:25:58,803 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:25:58,803 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:25:58,803 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:25:58,803 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:25:58,803 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:25:58,803 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:25:58,803 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:25:58,803 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:25:58,803 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:25:58,804 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:25:58,804 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:25:58,804 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:25:58,804 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:25:58,804 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:25:58,804 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:25:58,804 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:25:58,804 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:25:58,986 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:25:58,991 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:25:58,993 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:25:58,994 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:25:58,994 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:25:58,995 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0390f613-4598-4e1c-a121-a81379436de1/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/hcai-bench/svcomp/O0/O0_recHanoi01_true-unreach-call_true-no-overflow_true-termination_000.smt2
[2025-05-07 17:25:58,996 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:25:58,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:25:59,162 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0390f613-4598-4e1c-a121-a81379436de1/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/hcai-bench/svcomp/O0/O0_recHanoi01_true-unreach-call_true-no-overflow_true-termination_000.smt2
[2025-05-07 17:25:59,165 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:25:59,166 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:25:59,167 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:25:59,167 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:25:59,167 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:25:59,169 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:25:59" (1/1) ...
[2025-05-07 17:25:59,198 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:59 Unit
[2025-05-07 17:25:59,198 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:25:59,199 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:25:59,199 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:25:59,199 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:25:59,210 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:59" (1/1) ...
[2025-05-07 17:25:59,210 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:59" (1/1) ...
[2025-05-07 17:25:59,229 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:59" (1/1) ...
[2025-05-07 17:25:59,229 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:59" (1/1) ...
[2025-05-07 17:25:59,231 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:59" (1/1) ...
[2025-05-07 17:25:59,232 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:59" (1/1) ...
[2025-05-07 17:25:59,233 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:59" (1/1) ...
[2025-05-07 17:25:59,234 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:59" (1/1) ...
[2025-05-07 17:25:59,234 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:59" (1/1) ...
[2025-05-07 17:25:59,242 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:25:59,242 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:25:59,242 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:25:59,242 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:25:59,243 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:59" (1/1) ...
[2025-05-07 17:25:59,246 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:25:59,253 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:59,262 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-05-07 17:25:59,264 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:25:59,281 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:25:59,281 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:25:59,282 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:25:59,282 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATverifier.error.split given in one single declaration
[2025-05-07 17:25:59,282 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATverifier.error.split
[2025-05-07 17:25:59,282 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATverifier.error.split
[2025-05-07 17:25:59,282 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-05-07 17:25:59,282 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-05-07 17:25:59,282 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-05-07 17:25:59,282 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure hanoi given in one single declaration
[2025-05-07 17:25:59,282 INFO  L130     BoogieDeclarations]: Found specification of procedure hanoi
[2025-05-07 17:25:59,282 INFO  L138     BoogieDeclarations]: Found implementation of procedure hanoi
[2025-05-07 17:25:59,282 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure hanoi.AT.split given in one single declaration
[2025-05-07 17:25:59,283 INFO  L130     BoogieDeclarations]: Found specification of procedure hanoi.AT.split
[2025-05-07 17:25:59,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure hanoi.AT.split
[2025-05-07 17:25:59,283 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure hanoi.AT_1 given in one single declaration
[2025-05-07 17:25:59,283 INFO  L130     BoogieDeclarations]: Found specification of procedure hanoi.AT_1
[2025-05-07 17:25:59,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure hanoi.AT_1
[2025-05-07 17:25:59,283 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure applyHanoi given in one single declaration
[2025-05-07 17:25:59,283 INFO  L130     BoogieDeclarations]: Found specification of procedure applyHanoi
[2025-05-07 17:25:59,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure applyHanoi
[2025-05-07 17:25:59,283 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure applyHanoi.AT_shadow.mem.0 given in one single declaration
[2025-05-07 17:25:59,283 INFO  L130     BoogieDeclarations]: Found specification of procedure applyHanoi.AT_shadow.mem.0
[2025-05-07 17:25:59,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure applyHanoi.AT_shadow.mem.0
[2025-05-07 17:25:59,283 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure applyHanoi.AT_1 given in one single declaration
[2025-05-07 17:25:59,284 INFO  L130     BoogieDeclarations]: Found specification of procedure applyHanoi.AT_1
[2025-05-07 17:25:59,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure applyHanoi.AT_1
[2025-05-07 17:25:59,284 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:25:59,284 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:25:59,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:25:59,335 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:25:59,336 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:25:59,433 INFO  L?                        ?]: Removed 34 outVars from TransFormulas that were not future-live.
[2025-05-07 17:25:59,434 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:25:59,444 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:25:59,444 INFO  L312             CfgBuilder]: Removed 4 assume(true) statements.
[2025-05-07 17:25:59,445 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:25:59 BoogieIcfgContainer
[2025-05-07 17:25:59,445 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:25:59,447 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:25:59,448 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:25:59,451 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:25:59,451 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:25:59" (1/3) ...
[2025-05-07 17:25:59,452 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7075d593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:25:59, skipping insertion in model container
[2025-05-07 17:25:59,452 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:59" (2/3) ...
[2025-05-07 17:25:59,452 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7075d593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:25:59, skipping insertion in model container
[2025-05-07 17:25:59,452 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:25:59" (3/3) ...
[2025-05-07 17:25:59,453 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:25:59,467 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:25:59,469 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 10 procedures, 39 locations, 59 edges, 10 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:25:59,506 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:25:59,517 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;@5d8d6175, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:25:59,517 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:25:59,519 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 39 states, 16 states have (on average 1.4375) internal successors, (23), 19 states have internal predecessors, (23), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2025-05-07 17:25:59,524 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-05-07 17:25:59,524 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:59,525 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:59,525 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:59,528 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:59,528 INFO  L85        PathProgramCache]: Analyzing trace with hash -187770143, now seen corresponding path program 1 times
[2025-05-07 17:25:59,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:59,534 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883597246]
[2025-05-07 17:25:59,534 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:59,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:59,559 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-05-07 17:25:59,578 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-05-07 17:25:59,579 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:59,579 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:59,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:59,668 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:59,668 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883597246]
[2025-05-07 17:25:59,669 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883597246] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:59,669 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:59,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:59,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460425569]
[2025-05-07 17:25:59,672 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:59,675 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:59,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:59,692 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:59,692 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:59,693 INFO  L87              Difference]: Start difference. First operand  has 39 states, 16 states have (on average 1.4375) internal successors, (23), 19 states have internal predecessors, (23), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:25:59,740 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:59,740 INFO  L93              Difference]: Finished difference Result 39 states and 48 transitions.
[2025-05-07 17:25:59,741 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:59,742 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 19
[2025-05-07 17:25:59,742 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:59,760 INFO  L225             Difference]: With dead ends: 39
[2025-05-07 17:25:59,760 INFO  L226             Difference]: Without dead ends: 39
[2025-05-07 17:25:59,761 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-05-07 17:25:59,763 INFO  L437           NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:59,764 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 117 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:59,778 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2025-05-07 17:25:59,796 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39.
[2025-05-07 17:25:59,798 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14)
[2025-05-07 17:25:59,801 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions.
[2025-05-07 17:25:59,806 INFO  L79                 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 19
[2025-05-07 17:25:59,807 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:59,807 INFO  L485      AbstractCegarLoop]: Abstraction has 39 states and 48 transitions.
[2025-05-07 17:25:59,807 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:25:59,807 INFO  L278                IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions.
[2025-05-07 17:25:59,809 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-05-07 17:25:59,809 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:59,809 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:59,810 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:25:59,810 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:59,810 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:59,811 INFO  L85        PathProgramCache]: Analyzing trace with hash -870834536, now seen corresponding path program 1 times
[2025-05-07 17:25:59,811 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:59,811 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256328600]
[2025-05-07 17:25:59,811 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:59,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:59,820 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-05-07 17:25:59,827 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-05-07 17:25:59,827 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:59,827 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:59,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:59,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:59,900 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256328600]
[2025-05-07 17:25:59,900 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256328600] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:59,900 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:59,900 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:59,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506918874]
[2025-05-07 17:25:59,900 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:59,901 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:59,901 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:59,902 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:59,902 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:59,902 INFO  L87              Difference]: Start difference. First operand 39 states and 48 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:25:59,924 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:59,925 INFO  L93              Difference]: Finished difference Result 43 states and 54 transitions.
[2025-05-07 17:25:59,925 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:59,925 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 19
[2025-05-07 17:25:59,925 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:59,926 INFO  L225             Difference]: With dead ends: 43
[2025-05-07 17:25:59,926 INFO  L226             Difference]: Without dead ends: 43
[2025-05-07 17:25:59,927 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-05-07 17:25:59,927 INFO  L437           NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:59,928 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 117 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:59,929 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2025-05-07 17:25:59,933 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39.
[2025-05-07 17:25:59,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14)
[2025-05-07 17:25:59,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions.
[2025-05-07 17:25:59,935 INFO  L79                 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 19
[2025-05-07 17:25:59,935 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:59,935 INFO  L485      AbstractCegarLoop]: Abstraction has 39 states and 48 transitions.
[2025-05-07 17:25:59,935 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:25:59,935 INFO  L278                IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions.
[2025-05-07 17:25:59,936 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2025-05-07 17:25:59,936 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:59,936 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:59,936 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:25:59,937 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:59,937 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:59,937 INFO  L85        PathProgramCache]: Analyzing trace with hash -1639541853, now seen corresponding path program 1 times
[2025-05-07 17:25:59,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:59,937 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618409360]
[2025-05-07 17:25:59,938 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:59,938 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:59,950 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes.
[2025-05-07 17:25:59,958 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements.
[2025-05-07 17:25:59,958 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:59,958 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:00,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:26:00,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:00,012 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618409360]
[2025-05-07 17:26:00,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618409360] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:00,012 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379628359]
[2025-05-07 17:26:00,012 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:00,012 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:00,015 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:00,017 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:00,018 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:26:00,069 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes.
[2025-05-07 17:26:00,096 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements.
[2025-05-07 17:26:00,096 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:00,096 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:00,098 INFO  L256         TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:00,103 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:00,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-05-07 17:26:00,133 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:26:00,133 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379628359] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:00,133 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:26:00,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-05-07 17:26:00,133 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90530283]
[2025-05-07 17:26:00,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:00,133 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:00,133 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:00,134 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:00,134 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:00,134 INFO  L87              Difference]: Start difference. First operand 39 states and 48 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:26:00,149 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:00,149 INFO  L93              Difference]: Finished difference Result 41 states and 50 transitions.
[2025-05-07 17:26:00,149 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:00,149 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 34
[2025-05-07 17:26:00,150 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:00,150 INFO  L225             Difference]: With dead ends: 41
[2025-05-07 17:26:00,150 INFO  L226             Difference]: Without dead ends: 41
[2025-05-07 17:26:00,150 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:00,151 INFO  L437           NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:00,151 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 121 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:00,152 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2025-05-07 17:26:00,154 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2025-05-07 17:26:00,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15)
[2025-05-07 17:26:00,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions.
[2025-05-07 17:26:00,155 INFO  L79                 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 34
[2025-05-07 17:26:00,155 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:00,155 INFO  L485      AbstractCegarLoop]: Abstraction has 41 states and 50 transitions.
[2025-05-07 17:26:00,155 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:26:00,156 INFO  L278                IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions.
[2025-05-07 17:26:00,156 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2025-05-07 17:26:00,156 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:00,156 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:00,160 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:26:00,357 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:00,358 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:00,359 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:00,359 INFO  L85        PathProgramCache]: Analyzing trace with hash 1253296287, now seen corresponding path program 1 times
[2025-05-07 17:26:00,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:00,360 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942469203]
[2025-05-07 17:26:00,360 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:00,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:00,392 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes.
[2025-05-07 17:26:00,411 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements.
[2025-05-07 17:26:00,412 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:00,412 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:00,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:26:00,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:00,510 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942469203]
[2025-05-07 17:26:00,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942469203] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:00,510 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682059159]
[2025-05-07 17:26:00,510 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:00,510 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:00,513 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:00,515 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:00,516 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:26:00,563 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes.
[2025-05-07 17:26:00,583 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements.
[2025-05-07 17:26:00,583 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:00,583 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:00,584 INFO  L256         TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:00,586 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:00,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:26:00,602 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:26:00,602 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682059159] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:00,603 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:26:00,603 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-05-07 17:26:00,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579883405]
[2025-05-07 17:26:00,603 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:00,603 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:00,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:00,604 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:00,604 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:00,604 INFO  L87              Difference]: Start difference. First operand 41 states and 50 transitions. Second operand  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:26:00,620 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:00,620 INFO  L93              Difference]: Finished difference Result 43 states and 52 transitions.
[2025-05-07 17:26:00,621 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:00,621 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) Word has length 34
[2025-05-07 17:26:00,621 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:00,622 INFO  L225             Difference]: With dead ends: 43
[2025-05-07 17:26:00,622 INFO  L226             Difference]: Without dead ends: 43
[2025-05-07 17:26:00,622 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:00,623 INFO  L437           NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:00,623 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 121 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:00,624 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2025-05-07 17:26:00,627 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43.
[2025-05-07 17:26:00,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 43 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 12 states have call successors, (12), 9 states have call predecessors, (12), 12 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16)
[2025-05-07 17:26:00,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions.
[2025-05-07 17:26:00,629 INFO  L79                 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 34
[2025-05-07 17:26:00,629 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:00,629 INFO  L485      AbstractCegarLoop]: Abstraction has 43 states and 52 transitions.
[2025-05-07 17:26:00,629 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:26:00,629 INFO  L278                IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions.
[2025-05-07 17:26:00,630 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2025-05-07 17:26:00,630 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:00,630 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:00,633 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-05-07 17:26:00,831 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:00,831 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:00,833 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:00,833 INFO  L85        PathProgramCache]: Analyzing trace with hash 974118024, now seen corresponding path program 1 times
[2025-05-07 17:26:00,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:00,833 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545960679]
[2025-05-07 17:26:00,834 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:00,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:00,858 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes.
[2025-05-07 17:26:00,874 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements.
[2025-05-07 17:26:00,875 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:00,875 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:00,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:26:00,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:00,956 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545960679]
[2025-05-07 17:26:00,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545960679] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:00,956 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:00,956 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:00,957 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501529323]
[2025-05-07 17:26:00,957 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:00,957 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:00,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:00,958 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:00,958 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:00,958 INFO  L87              Difference]: Start difference. First operand 43 states and 52 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:26:00,972 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:00,972 INFO  L93              Difference]: Finished difference Result 43 states and 51 transitions.
[2025-05-07 17:26:00,973 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:00,973 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 34
[2025-05-07 17:26:00,973 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:00,974 INFO  L225             Difference]: With dead ends: 43
[2025-05-07 17:26:00,974 INFO  L226             Difference]: Without dead ends: 41
[2025-05-07 17:26:00,974 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-05-07 17:26:00,975 INFO  L437           NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:00,975 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:00,976 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2025-05-07 17:26:00,980 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2025-05-07 17:26:00,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 20 states have internal predecessors, (21), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15)
[2025-05-07 17:26:00,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions.
[2025-05-07 17:26:00,981 INFO  L79                 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 34
[2025-05-07 17:26:00,981 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:00,981 INFO  L485      AbstractCegarLoop]: Abstraction has 41 states and 48 transitions.
[2025-05-07 17:26:00,981 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:26:00,981 INFO  L278                IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions.
[2025-05-07 17:26:00,982 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2025-05-07 17:26:00,982 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:00,982 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:00,983 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:26:00,983 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:00,983 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:00,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -15569729, now seen corresponding path program 1 times
[2025-05-07 17:26:00,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:00,983 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546494803]
[2025-05-07 17:26:00,984 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:00,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:00,993 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes.
[2025-05-07 17:26:01,000 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements.
[2025-05-07 17:26:01,000 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:01,000 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:01,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-05-07 17:26:01,060 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:01,061 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546494803]
[2025-05-07 17:26:01,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546494803] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:01,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:01,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:01,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889863995]
[2025-05-07 17:26:01,061 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:01,061 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:01,061 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:01,061 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:01,061 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:01,062 INFO  L87              Difference]: Start difference. First operand 41 states and 48 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:26:01,073 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:01,073 INFO  L93              Difference]: Finished difference Result 45 states and 52 transitions.
[2025-05-07 17:26:01,073 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:01,073 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 34
[2025-05-07 17:26:01,073 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:01,074 INFO  L225             Difference]: With dead ends: 45
[2025-05-07 17:26:01,074 INFO  L226             Difference]: Without dead ends: 45
[2025-05-07 17:26:01,074 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-05-07 17:26:01,074 INFO  L437           NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:01,075 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 115 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:01,075 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2025-05-07 17:26:01,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41.
[2025-05-07 17:26:01,078 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15)
[2025-05-07 17:26:01,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions.
[2025-05-07 17:26:01,078 INFO  L79                 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 34
[2025-05-07 17:26:01,079 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:01,079 INFO  L485      AbstractCegarLoop]: Abstraction has 41 states and 48 transitions.
[2025-05-07 17:26:01,079 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:26:01,079 INFO  L278                IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions.
[2025-05-07 17:26:01,079 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2025-05-07 17:26:01,079 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:01,079 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:01,080 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:26:01,080 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:01,080 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:01,080 INFO  L85        PathProgramCache]: Analyzing trace with hash -405176420, now seen corresponding path program 1 times
[2025-05-07 17:26:01,080 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:01,080 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403581028]
[2025-05-07 17:26:01,080 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:01,080 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:01,089 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-05-07 17:26:01,095 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-05-07 17:26:01,095 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:01,095 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:01,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-05-07 17:26:01,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:01,137 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403581028]
[2025-05-07 17:26:01,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403581028] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:01,137 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:01,137 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:01,137 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336280665]
[2025-05-07 17:26:01,137 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:01,137 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:01,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:01,138 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:01,138 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:01,138 INFO  L87              Difference]: Start difference. First operand 41 states and 48 transitions. Second operand  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)
[2025-05-07 17:26:01,148 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:01,149 INFO  L93              Difference]: Finished difference Result 43 states and 49 transitions.
[2025-05-07 17:26:01,149 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:01,149 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 45
[2025-05-07 17:26:01,149 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:01,150 INFO  L225             Difference]: With dead ends: 43
[2025-05-07 17:26:01,150 INFO  L226             Difference]: Without dead ends: 41
[2025-05-07 17:26:01,150 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-05-07 17:26:01,151 INFO  L437           NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:01,151 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:01,152 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2025-05-07 17:26:01,154 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2025-05-07 17:26:01,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15)
[2025-05-07 17:26:01,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions.
[2025-05-07 17:26:01,155 INFO  L79                 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 45
[2025-05-07 17:26:01,156 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:01,156 INFO  L485      AbstractCegarLoop]: Abstraction has 41 states and 46 transitions.
[2025-05-07 17:26:01,156 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)
[2025-05-07 17:26:01,156 INFO  L278                IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions.
[2025-05-07 17:26:01,157 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2025-05-07 17:26:01,157 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:01,157 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:01,157 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:26:01,157 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:01,158 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:01,158 INFO  L85        PathProgramCache]: Analyzing trace with hash -2140416360, now seen corresponding path program 1 times
[2025-05-07 17:26:01,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:01,158 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417941219]
[2025-05-07 17:26:01,158 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:01,158 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:01,168 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-05-07 17:26:01,176 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-05-07 17:26:01,176 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:01,176 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:01,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-05-07 17:26:01,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:01,304 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417941219]
[2025-05-07 17:26:01,304 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417941219] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:01,304 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153460826]
[2025-05-07 17:26:01,304 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:01,304 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:01,307 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:01,309 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:01,310 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-05-07 17:26:01,358 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-05-07 17:26:01,379 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-05-07 17:26:01,379 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:01,379 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:01,380 INFO  L256         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:01,382 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:01,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-05-07 17:26:01,464 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:26:01,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-05-07 17:26:01,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [153460826] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:26:01,942 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:26:01,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9
[2025-05-07 17:26:01,942 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635502129]
[2025-05-07 17:26:01,942 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:26:01,942 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-05-07 17:26:01,942 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:01,943 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-05-07 17:26:01,943 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:26:01,943 INFO  L87              Difference]: Start difference. First operand 41 states and 46 transitions. Second operand  has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 9 states have internal predecessors, (29), 7 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (21), 5 states have call predecessors, (21), 7 states have call successors, (21)
[2025-05-07 17:26:01,993 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:01,993 INFO  L93              Difference]: Finished difference Result 47 states and 57 transitions.
[2025-05-07 17:26:01,993 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:26:01,994 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 9 states have internal predecessors, (29), 7 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (21), 5 states have call predecessors, (21), 7 states have call successors, (21) Word has length 45
[2025-05-07 17:26:01,994 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:01,994 INFO  L225             Difference]: With dead ends: 47
[2025-05-07 17:26:01,994 INFO  L226             Difference]: Without dead ends: 47
[2025-05-07 17:26:01,995 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:26:01,995 INFO  L437           NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:01,995 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 212 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:01,996 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2025-05-07 17:26:02,000 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2025-05-07 17:26:02,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 47 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 14 states have call successors, (14), 9 states have call predecessors, (14), 13 states have return successors, (22), 16 states have call predecessors, (22), 14 states have call successors, (22)
[2025-05-07 17:26:02,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions.
[2025-05-07 17:26:02,001 INFO  L79                 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 45
[2025-05-07 17:26:02,001 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:02,001 INFO  L485      AbstractCegarLoop]: Abstraction has 47 states and 57 transitions.
[2025-05-07 17:26:02,001 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 9 states have internal predecessors, (29), 7 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (21), 5 states have call predecessors, (21), 7 states have call successors, (21)
[2025-05-07 17:26:02,001 INFO  L278                IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions.
[2025-05-07 17:26:02,002 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2025-05-07 17:26:02,002 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:02,003 INFO  L218           NwaCegarLoop]: trace histogram [7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:02,006 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-05-07 17:26:02,203 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:02,204 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:02,205 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:02,205 INFO  L85        PathProgramCache]: Analyzing trace with hash 1154964090, now seen corresponding path program 2 times
[2025-05-07 17:26:02,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:02,206 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461549632]
[2025-05-07 17:26:02,206 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:26:02,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:02,265 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes.
[2025-05-07 17:26:02,286 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements.
[2025-05-07 17:26:02,286 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:26:02,286 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:03,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 93 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2025-05-07 17:26:03,053 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:03,053 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461549632]
[2025-05-07 17:26:03,053 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461549632] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:03,053 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907818167]
[2025-05-07 17:26:03,053 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:26:03,053 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:03,056 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:03,057 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:03,058 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-05-07 17:26:03,111 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes.
[2025-05-07 17:26:03,142 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements.
[2025-05-07 17:26:03,143 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:26:03,143 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:03,145 INFO  L256         TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 63 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:03,149 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:03,189 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2025-05-07 17:26:03,419 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9
[2025-05-07 17:26:03,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 93 backedges. 14 proven. 40 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2025-05-07 17:26:03,515 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:26:06,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 93 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2025-05-07 17:26:06,411 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [907818167] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:26:06,411 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:26:06,411 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 29
[2025-05-07 17:26:06,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609770313]
[2025-05-07 17:26:06,411 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:26:06,412 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2025-05-07 17:26:06,412 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:06,412 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2025-05-07 17:26:06,412 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812
[2025-05-07 17:26:06,412 INFO  L87              Difference]: Start difference. First operand 47 states and 57 transitions. Second operand  has 29 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 24 states have internal predecessors, (35), 19 states have call successors, (30), 2 states have call predecessors, (30), 13 states have return successors, (33), 17 states have call predecessors, (33), 19 states have call successors, (33)
[2025-05-07 17:26:06,829 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:06,829 INFO  L93              Difference]: Finished difference Result 72 states and 93 transitions.
[2025-05-07 17:26:06,829 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-05-07 17:26:06,829 INFO  L79                 Accepts]: Start accepts. Automaton has  has 29 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 24 states have internal predecessors, (35), 19 states have call successors, (30), 2 states have call predecessors, (30), 13 states have return successors, (33), 17 states have call predecessors, (33), 19 states have call successors, (33) Word has length 75
[2025-05-07 17:26:06,830 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:06,831 INFO  L225             Difference]: With dead ends: 72
[2025-05-07 17:26:06,831 INFO  L226             Difference]: Without dead ends: 72
[2025-05-07 17:26:06,832 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=1310, Unknown=0, NotChecked=0, Total=1482
[2025-05-07 17:26:06,832 INFO  L437           NwaCegarLoop]: 48 mSDtfsCounter, 30 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:06,832 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 768 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:26:06,833 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2025-05-07 17:26:06,841 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61.
[2025-05-07 17:26:06,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 17 states have call successors, (17), 10 states have call predecessors, (17), 18 states have return successors, (36), 23 states have call predecessors, (36), 17 states have call successors, (36)
[2025-05-07 17:26:06,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions.
[2025-05-07 17:26:06,842 INFO  L79                 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 75
[2025-05-07 17:26:06,843 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:06,843 INFO  L485      AbstractCegarLoop]: Abstraction has 61 states and 81 transitions.
[2025-05-07 17:26:06,843 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 24 states have internal predecessors, (35), 19 states have call successors, (30), 2 states have call predecessors, (30), 13 states have return successors, (33), 17 states have call predecessors, (33), 19 states have call successors, (33)
[2025-05-07 17:26:06,843 INFO  L278                IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions.
[2025-05-07 17:26:06,844 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-05-07 17:26:06,844 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:06,845 INFO  L218           NwaCegarLoop]: trace histogram [11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:06,848 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-05-07 17:26:07,045 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-05-07 17:26:07,046 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:07,047 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:07,048 INFO  L85        PathProgramCache]: Analyzing trace with hash -1629722916, now seen corresponding path program 3 times
[2025-05-07 17:26:07,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:07,049 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556210705]
[2025-05-07 17:26:07,049 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:26:07,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:07,091 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 7 equivalence classes.
[2025-05-07 17:26:07,110 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 94 of 105 statements.
[2025-05-07 17:26:07,110 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2025-05-07 17:26:07,110 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:07,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 258 backedges. 74 proven. 57 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked.
[2025-05-07 17:26:07,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:07,624 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556210705]
[2025-05-07 17:26:07,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556210705] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:07,624 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210551082]
[2025-05-07 17:26:07,624 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:26:07,624 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:07,627 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:07,628 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:07,629 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-05-07 17:26:07,714 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 7 equivalence classes.
[2025-05-07 17:26:07,761 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 94 of 105 statements.
[2025-05-07 17:26:07,761 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2025-05-07 17:26:07,761 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:07,764 INFO  L256         TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 27 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:07,766 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:07,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 258 backedges. 90 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked.
[2025-05-07 17:26:07,943 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:26:10,694 INFO  L134       CoverageAnalysis]: Checked inductivity of 258 backedges. 95 proven. 27 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked.
[2025-05-07 17:26:10,695 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [210551082] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:26:10,695 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:26:10,695 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 19] total 33
[2025-05-07 17:26:10,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010714429]
[2025-05-07 17:26:10,695 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:26:10,695 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2025-05-07 17:26:10,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:10,696 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2025-05-07 17:26:10,696 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056
[2025-05-07 17:26:10,696 INFO  L87              Difference]: Start difference. First operand 61 states and 81 transitions. Second operand  has 33 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 31 states have internal predecessors, (46), 18 states have call successors, (42), 2 states have call predecessors, (42), 19 states have return successors, (51), 27 states have call predecessors, (51), 18 states have call successors, (51)
[2025-05-07 17:26:11,149 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:11,149 INFO  L93              Difference]: Finished difference Result 81 states and 123 transitions.
[2025-05-07 17:26:11,149 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-05-07 17:26:11,149 INFO  L79                 Accepts]: Start accepts. Automaton has  has 33 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 31 states have internal predecessors, (46), 18 states have call successors, (42), 2 states have call predecessors, (42), 19 states have return successors, (51), 27 states have call predecessors, (51), 18 states have call successors, (51) Word has length 105
[2025-05-07 17:26:11,150 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:11,151 INFO  L225             Difference]: With dead ends: 81
[2025-05-07 17:26:11,151 INFO  L226             Difference]: Without dead ends: 79
[2025-05-07 17:26:11,151 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640
[2025-05-07 17:26:11,152 INFO  L437           NwaCegarLoop]: 49 mSDtfsCounter, 18 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:11,152 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1042 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:26:11,152 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2025-05-07 17:26:11,158 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70.
[2025-05-07 17:26:11,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 70 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 23 states have call successors, (23), 15 states have call predecessors, (23), 17 states have return successors, (48), 25 states have call predecessors, (48), 23 states have call successors, (48)
[2025-05-07 17:26:11,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions.
[2025-05-07 17:26:11,159 INFO  L79                 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 105
[2025-05-07 17:26:11,159 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:11,159 INFO  L485      AbstractCegarLoop]: Abstraction has 70 states and 102 transitions.
[2025-05-07 17:26:11,159 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 31 states have internal predecessors, (46), 18 states have call successors, (42), 2 states have call predecessors, (42), 19 states have return successors, (51), 27 states have call predecessors, (51), 18 states have call successors, (51)
[2025-05-07 17:26:11,159 INFO  L278                IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions.
[2025-05-07 17:26:11,160 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-05-07 17:26:11,160 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:11,160 INFO  L218           NwaCegarLoop]: trace histogram [11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:11,165 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-05-07 17:26:11,361 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:11,361 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:11,361 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:11,361 INFO  L85        PathProgramCache]: Analyzing trace with hash 1900666140, now seen corresponding path program 4 times
[2025-05-07 17:26:11,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:11,362 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210014146]
[2025-05-07 17:26:11,362 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:26:11,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:11,372 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 105 statements into 2 equivalence classes.
[2025-05-07 17:26:11,378 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 104 of 105 statements.
[2025-05-07 17:26:11,379 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-05-07 17:26:11,379 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:11,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 258 backedges. 40 proven. 81 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked.
[2025-05-07 17:26:11,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:11,711 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210014146]
[2025-05-07 17:26:11,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210014146] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:11,711 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69725457]
[2025-05-07 17:26:11,711 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:26:11,711 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:11,713 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:11,715 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:11,716 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-05-07 17:26:11,850 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 105 statements into 2 equivalence classes.
[2025-05-07 17:26:11,880 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 104 of 105 statements.
[2025-05-07 17:26:11,880 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-05-07 17:26:11,880 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:11,882 INFO  L256         TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:11,883 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:12,008 INFO  L134       CoverageAnalysis]: Checked inductivity of 258 backedges. 69 proven. 70 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked.
[2025-05-07 17:26:12,008 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:26:14,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 258 backedges. 74 proven. 71 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked.
[2025-05-07 17:26:14,100 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [69725457] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:26:14,100 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:26:14,101 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 16] total 30
[2025-05-07 17:26:14,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627717641]
[2025-05-07 17:26:14,101 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:26:14,101 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2025-05-07 17:26:14,101 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:14,101 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2025-05-07 17:26:14,102 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870
[2025-05-07 17:26:14,102 INFO  L87              Difference]: Start difference. First operand 70 states and 102 transitions. Second operand  has 30 states, 15 states have (on average 3.6) internal successors, (54), 28 states have internal predecessors, (54), 22 states have call successors, (44), 2 states have call predecessors, (44), 15 states have return successors, (52), 16 states have call predecessors, (52), 22 states have call successors, (52)
[2025-05-07 17:26:14,456 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:14,456 INFO  L93              Difference]: Finished difference Result 85 states and 131 transitions.
[2025-05-07 17:26:14,456 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-05-07 17:26:14,457 INFO  L79                 Accepts]: Start accepts. Automaton has  has 30 states, 15 states have (on average 3.6) internal successors, (54), 28 states have internal predecessors, (54), 22 states have call successors, (44), 2 states have call predecessors, (44), 15 states have return successors, (52), 16 states have call predecessors, (52), 22 states have call successors, (52) Word has length 105
[2025-05-07 17:26:14,457 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:14,458 INFO  L225             Difference]: With dead ends: 85
[2025-05-07 17:26:14,459 INFO  L226             Difference]: Without dead ends: 85
[2025-05-07 17:26:14,459 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332
[2025-05-07 17:26:14,460 INFO  L437           NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:14,460 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 800 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:26:14,461 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2025-05-07 17:26:14,469 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59.
[2025-05-07 17:26:14,469 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 59 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 18 states have call successors, (18), 13 states have call predecessors, (18), 15 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26)
[2025-05-07 17:26:14,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions.
[2025-05-07 17:26:14,470 INFO  L79                 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 105
[2025-05-07 17:26:14,470 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:14,470 INFO  L485      AbstractCegarLoop]: Abstraction has 59 states and 71 transitions.
[2025-05-07 17:26:14,470 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 15 states have (on average 3.6) internal successors, (54), 28 states have internal predecessors, (54), 22 states have call successors, (44), 2 states have call predecessors, (44), 15 states have return successors, (52), 16 states have call predecessors, (52), 22 states have call successors, (52)
[2025-05-07 17:26:14,471 INFO  L278                IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions.
[2025-05-07 17:26:14,471 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-05-07 17:26:14,472 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:14,472 INFO  L218           NwaCegarLoop]: trace histogram [7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:14,475 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-05-07 17:26:14,672 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:14,673 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:14,673 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:14,674 INFO  L85        PathProgramCache]: Analyzing trace with hash 1628186501, now seen corresponding path program 5 times
[2025-05-07 17:26:14,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:14,674 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742603123]
[2025-05-07 17:26:14,674 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-05-07 17:26:14,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:14,685 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 86 statements into 6 equivalence classes.
[2025-05-07 17:26:14,696 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 86 of 86 statements.
[2025-05-07 17:26:14,696 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s)
[2025-05-07 17:26:14,696 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:15,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 107 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked.
[2025-05-07 17:26:15,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:15,012 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742603123]
[2025-05-07 17:26:15,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742603123] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:15,012 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225922112]
[2025-05-07 17:26:15,012 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-05-07 17:26:15,012 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:15,015 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:15,016 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:15,017 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-05-07 17:26:15,155 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 86 statements into 6 equivalence classes.
[2025-05-07 17:26:15,200 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 86 of 86 statements.
[2025-05-07 17:26:15,200 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s)
[2025-05-07 17:26:15,200 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:15,202 INFO  L256         TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:15,203 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:15,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 107 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked.
[2025-05-07 17:26:15,333 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:26:16,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 107 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked.
[2025-05-07 17:26:16,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225922112] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:26:16,641 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:26:16,641 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 30
[2025-05-07 17:26:16,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858608886]
[2025-05-07 17:26:16,641 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:26:16,641 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2025-05-07 17:26:16,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:16,642 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2025-05-07 17:26:16,643 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870
[2025-05-07 17:26:16,643 INFO  L87              Difference]: Start difference. First operand 59 states and 71 transitions. Second operand  has 30 states, 17 states have (on average 2.764705882352941) internal successors, (47), 28 states have internal predecessors, (47), 17 states have call successors, (35), 2 states have call predecessors, (35), 17 states have return successors, (39), 22 states have call predecessors, (39), 17 states have call successors, (39)
[2025-05-07 17:26:16,845 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:16,845 INFO  L93              Difference]: Finished difference Result 65 states and 82 transitions.
[2025-05-07 17:26:16,845 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-05-07 17:26:16,846 INFO  L79                 Accepts]: Start accepts. Automaton has  has 30 states, 17 states have (on average 2.764705882352941) internal successors, (47), 28 states have internal predecessors, (47), 17 states have call successors, (35), 2 states have call predecessors, (35), 17 states have return successors, (39), 22 states have call predecessors, (39), 17 states have call successors, (39) Word has length 86
[2025-05-07 17:26:16,846 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:16,847 INFO  L225             Difference]: With dead ends: 65
[2025-05-07 17:26:16,847 INFO  L226             Difference]: Without dead ends: 64
[2025-05-07 17:26:16,847 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406
[2025-05-07 17:26:16,847 INFO  L437           NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:16,847 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 499 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:26:16,848 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2025-05-07 17:26:16,850 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63.
[2025-05-07 17:26:16,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 18 states have call successors, (18), 13 states have call predecessors, (18), 17 states have return successors, (32), 22 states have call predecessors, (32), 18 states have call successors, (32)
[2025-05-07 17:26:16,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions.
[2025-05-07 17:26:16,850 INFO  L79                 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 86
[2025-05-07 17:26:16,850 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:16,851 INFO  L485      AbstractCegarLoop]: Abstraction has 63 states and 79 transitions.
[2025-05-07 17:26:16,851 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 17 states have (on average 2.764705882352941) internal successors, (47), 28 states have internal predecessors, (47), 17 states have call successors, (35), 2 states have call predecessors, (35), 17 states have return successors, (39), 22 states have call predecessors, (39), 17 states have call successors, (39)
[2025-05-07 17:26:16,851 INFO  L278                IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions.
[2025-05-07 17:26:16,851 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 147
[2025-05-07 17:26:16,851 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:16,852 INFO  L218           NwaCegarLoop]: trace histogram [15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:16,855 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-05-07 17:26:17,052 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-05-07 17:26:17,053 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:17,054 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:17,054 INFO  L85        PathProgramCache]: Analyzing trace with hash 1450984833, now seen corresponding path program 6 times
[2025-05-07 17:26:17,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:17,054 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470748624]
[2025-05-07 17:26:17,054 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-05-07 17:26:17,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:17,100 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 146 statements into 10 equivalence classes.
[2025-05-07 17:26:17,126 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 146 of 146 statements.
[2025-05-07 17:26:17,126 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s)
[2025-05-07 17:26:17,126 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:18,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 521 backedges. 72 proven. 214 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked.
[2025-05-07 17:26:18,920 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:18,920 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470748624]
[2025-05-07 17:26:18,920 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470748624] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:18,920 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165849120]
[2025-05-07 17:26:18,920 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-05-07 17:26:18,920 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:18,922 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:18,923 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:18,924 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-05-07 17:26:19,078 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 146 statements into 10 equivalence classes.
[2025-05-07 17:26:19,140 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 146 of 146 statements.
[2025-05-07 17:26:19,140 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s)
[2025-05-07 17:26:19,140 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:19,144 INFO  L256         TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 139 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:19,150 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:19,165 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2025-05-07 17:26:19,702 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9
[2025-05-07 17:26:20,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 521 backedges. 73 proven. 210 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked.
[2025-05-07 17:26:20,029 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:26:28,837 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:26:28,838 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:26:28,839 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:26:30,151 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:26:30,152 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:26:30,154 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:26:30,176 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:26:30,176 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:26:30,722 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:26:30,723 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:26:30,725 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:26:30,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 521 backedges. 73 proven. 217 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked.
[2025-05-07 17:26:30,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [165849120] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:26:30,934 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:26:30,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 30] total 59
[2025-05-07 17:26:30,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48602264]
[2025-05-07 17:26:30,935 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:26:30,935 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 59 states
[2025-05-07 17:26:30,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:30,936 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants.
[2025-05-07 17:26:30,937 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3228, Unknown=0, NotChecked=0, Total=3422
[2025-05-07 17:26:30,937 INFO  L87              Difference]: Start difference. First operand 63 states and 79 transitions. Second operand  has 59 states, 26 states have (on average 2.230769230769231) internal successors, (58), 47 states have internal predecessors, (58), 36 states have call successors, (57), 2 states have call predecessors, (57), 26 states have return successors, (69), 41 states have call predecessors, (69), 36 states have call successors, (69)
[2025-05-07 17:26:32,649 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:32,650 INFO  L93              Difference]: Finished difference Result 124 states and 181 transitions.
[2025-05-07 17:26:32,650 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 
[2025-05-07 17:26:32,650 INFO  L79                 Accepts]: Start accepts. Automaton has  has 59 states, 26 states have (on average 2.230769230769231) internal successors, (58), 47 states have internal predecessors, (58), 36 states have call successors, (57), 2 states have call predecessors, (57), 26 states have return successors, (69), 41 states have call predecessors, (69), 36 states have call successors, (69) Word has length 146
[2025-05-07 17:26:32,651 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:32,652 INFO  L225             Difference]: With dead ends: 124
[2025-05-07 17:26:32,652 INFO  L226             Difference]: Without dead ends: 116
[2025-05-07 17:26:32,654 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=592, Invalid=6548, Unknown=0, NotChecked=0, Total=7140
[2025-05-07 17:26:32,654 INFO  L437           NwaCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:32,654 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1736 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-05-07 17:26:32,655 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2025-05-07 17:26:32,665 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 84.
[2025-05-07 17:26:32,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 25 states have call successors, (25), 15 states have call predecessors, (25), 23 states have return successors, (47), 33 states have call predecessors, (47), 25 states have call successors, (47)
[2025-05-07 17:26:32,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions.
[2025-05-07 17:26:32,666 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 146
[2025-05-07 17:26:32,666 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:32,666 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 109 transitions.
[2025-05-07 17:26:32,667 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 59 states, 26 states have (on average 2.230769230769231) internal successors, (58), 47 states have internal predecessors, (58), 36 states have call successors, (57), 2 states have call predecessors, (57), 26 states have return successors, (69), 41 states have call predecessors, (69), 36 states have call successors, (69)
[2025-05-07 17:26:32,667 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions.
[2025-05-07 17:26:32,668 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2025-05-07 17:26:32,668 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:32,669 INFO  L218           NwaCegarLoop]: trace histogram [19, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:32,673 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-05-07 17:26:32,869 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-05-07 17:26:32,870 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:32,871 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:32,871 INFO  L85        PathProgramCache]: Analyzing trace with hash 1577711775, now seen corresponding path program 7 times
[2025-05-07 17:26:32,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:32,872 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504482386]
[2025-05-07 17:26:32,872 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-05-07 17:26:32,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:32,929 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes.
[2025-05-07 17:26:32,943 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements.
[2025-05-07 17:26:32,943 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:32,943 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:33,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 854 backedges. 119 proven. 245 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked.
[2025-05-07 17:26:33,312 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:33,312 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504482386]
[2025-05-07 17:26:33,312 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504482386] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:33,312 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333931068]
[2025-05-07 17:26:33,312 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-05-07 17:26:33,313 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:33,314 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:33,315 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:33,316 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-05-07 17:26:33,607 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes.
[2025-05-07 17:26:33,655 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements.
[2025-05-07 17:26:33,655 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:33,655 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:33,658 INFO  L256         TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:33,661 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:33,767 INFO  L134       CoverageAnalysis]: Checked inductivity of 854 backedges. 467 proven. 88 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked.
[2025-05-07 17:26:33,767 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:26:36,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 854 backedges. 119 proven. 246 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked.
[2025-05-07 17:26:36,467 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333931068] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:26:36,467 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:26:36,467 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 23
[2025-05-07 17:26:36,467 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781978573]
[2025-05-07 17:26:36,467 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:26:36,468 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-05-07 17:26:36,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:36,468 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-05-07 17:26:36,468 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506
[2025-05-07 17:26:36,468 INFO  L87              Difference]: Start difference. First operand 84 states and 109 transitions. Second operand  has 23 states, 10 states have (on average 5.1) internal successors, (51), 22 states have internal predecessors, (51), 19 states have call successors, (45), 2 states have call predecessors, (45), 10 states have return successors, (51), 10 states have call predecessors, (51), 19 states have call successors, (51)
[2025-05-07 17:26:36,631 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:36,632 INFO  L93              Difference]: Finished difference Result 88 states and 113 transitions.
[2025-05-07 17:26:36,632 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:26:36,632 INFO  L79                 Accepts]: Start accepts. Automaton has  has 23 states, 10 states have (on average 5.1) internal successors, (51), 22 states have internal predecessors, (51), 19 states have call successors, (45), 2 states have call predecessors, (45), 10 states have return successors, (51), 10 states have call predecessors, (51), 19 states have call successors, (51) Word has length 176
[2025-05-07 17:26:36,632 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:36,633 INFO  L225             Difference]: With dead ends: 88
[2025-05-07 17:26:36,633 INFO  L226             Difference]: Without dead ends: 88
[2025-05-07 17:26:36,633 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 342 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870
[2025-05-07 17:26:36,633 INFO  L437           NwaCegarLoop]: 45 mSDtfsCounter, 23 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:36,633 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 466 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:26:36,634 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2025-05-07 17:26:36,637 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88.
[2025-05-07 17:26:36,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 27 states have call successors, (27), 17 states have call predecessors, (27), 23 states have return successors, (47), 33 states have call predecessors, (47), 27 states have call successors, (47)
[2025-05-07 17:26:36,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions.
[2025-05-07 17:26:36,638 INFO  L79                 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 176
[2025-05-07 17:26:36,638 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:36,638 INFO  L485      AbstractCegarLoop]: Abstraction has 88 states and 113 transitions.
[2025-05-07 17:26:36,638 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 10 states have (on average 5.1) internal successors, (51), 22 states have internal predecessors, (51), 19 states have call successors, (45), 2 states have call predecessors, (45), 10 states have return successors, (51), 10 states have call predecessors, (51), 19 states have call successors, (51)
[2025-05-07 17:26:36,638 INFO  L278                IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions.
[2025-05-07 17:26:36,639 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-05-07 17:26:36,639 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:36,639 INFO  L218           NwaCegarLoop]: trace histogram [23, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:36,644 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-05-07 17:26:36,840 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-05-07 17:26:36,840 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:36,841 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:36,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -49938051, now seen corresponding path program 8 times
[2025-05-07 17:26:36,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:36,842 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621185254]
[2025-05-07 17:26:36,842 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:26:36,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:36,902 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 206 statements into 2 equivalence classes.
[2025-05-07 17:26:36,915 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 206 of 206 statements.
[2025-05-07 17:26:36,915 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:26:36,915 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:37,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 1271 backedges. 191 proven. 355 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked.
[2025-05-07 17:26:37,487 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:37,487 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621185254]
[2025-05-07 17:26:37,487 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621185254] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:37,487 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362485510]
[2025-05-07 17:26:37,487 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:26:37,487 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:37,488 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:37,490 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:37,490 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-05-07 17:26:37,789 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 206 statements into 2 equivalence classes.
[2025-05-07 17:26:37,847 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 206 of 206 statements.
[2025-05-07 17:26:37,847 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:26:37,847 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:37,850 INFO  L256         TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 35 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:37,853 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:37,976 INFO  L134       CoverageAnalysis]: Checked inductivity of 1271 backedges. 187 proven. 352 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked.
[2025-05-07 17:26:37,976 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:26:42,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 1271 backedges. 192 proven. 361 refuted. 0 times theorem prover too weak. 718 trivial. 0 not checked.
[2025-05-07 17:26:42,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362485510] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:26:42,565 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:26:42,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 24] total 32
[2025-05-07 17:26:42,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832121514]
[2025-05-07 17:26:42,565 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:26:42,566 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2025-05-07 17:26:42,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:42,566 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2025-05-07 17:26:42,567 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992
[2025-05-07 17:26:42,567 INFO  L87              Difference]: Start difference. First operand 88 states and 113 transitions. Second operand  has 32 states, 14 states have (on average 4.0) internal successors, (56), 31 states have internal predecessors, (56), 26 states have call successors, (48), 2 states have call predecessors, (48), 14 states have return successors, (58), 14 states have call predecessors, (58), 26 states have call successors, (58)
[2025-05-07 17:26:42,839 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:42,839 INFO  L93              Difference]: Finished difference Result 106 states and 145 transitions.
[2025-05-07 17:26:42,840 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-05-07 17:26:42,840 INFO  L79                 Accepts]: Start accepts. Automaton has  has 32 states, 14 states have (on average 4.0) internal successors, (56), 31 states have internal predecessors, (56), 26 states have call successors, (48), 2 states have call predecessors, (48), 14 states have return successors, (58), 14 states have call predecessors, (58), 26 states have call successors, (58) Word has length 206
[2025-05-07 17:26:42,840 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:42,841 INFO  L225             Difference]: With dead ends: 106
[2025-05-07 17:26:42,841 INFO  L226             Difference]: Without dead ends: 106
[2025-05-07 17:26:42,842 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 399 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=1511, Unknown=0, NotChecked=0, Total=1806
[2025-05-07 17:26:42,842 INFO  L437           NwaCegarLoop]: 52 mSDtfsCounter, 32 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:42,843 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 571 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:26:42,843 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2025-05-07 17:26:42,848 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94.
[2025-05-07 17:26:42,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 31 states have call successors, (31), 19 states have call predecessors, (31), 23 states have return successors, (50), 35 states have call predecessors, (50), 31 states have call successors, (50)
[2025-05-07 17:26:42,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 122 transitions.
[2025-05-07 17:26:42,849 INFO  L79                 Accepts]: Start accepts. Automaton has 94 states and 122 transitions. Word has length 206
[2025-05-07 17:26:42,849 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:42,849 INFO  L485      AbstractCegarLoop]: Abstraction has 94 states and 122 transitions.
[2025-05-07 17:26:42,849 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 14 states have (on average 4.0) internal successors, (56), 31 states have internal predecessors, (56), 26 states have call successors, (48), 2 states have call predecessors, (48), 14 states have return successors, (58), 14 states have call predecessors, (58), 26 states have call successors, (58)
[2025-05-07 17:26:42,849 INFO  L278                IsEmpty]: Start isEmpty. Operand 94 states and 122 transitions.
[2025-05-07 17:26:42,850 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-05-07 17:26:42,850 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:42,850 INFO  L218           NwaCegarLoop]: trace histogram [15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:42,855 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2025-05-07 17:26:43,051 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-05-07 17:26:43,051 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:43,052 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:43,052 INFO  L85        PathProgramCache]: Analyzing trace with hash 619016102, now seen corresponding path program 9 times
[2025-05-07 17:26:43,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:43,053 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669195137]
[2025-05-07 17:26:43,053 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:26:43,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:43,110 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 157 statements into 10 equivalence classes.
[2025-05-07 17:26:43,123 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 116 of 157 statements.
[2025-05-07 17:26:43,124 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2025-05-07 17:26:43,124 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:43,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 546 backedges. 148 proven. 79 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked.
[2025-05-07 17:26:43,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:43,666 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669195137]
[2025-05-07 17:26:43,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669195137] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:43,666 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778132067]
[2025-05-07 17:26:43,666 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:26:43,666 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:43,668 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:43,670 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:43,671 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-05-07 17:26:44,033 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 157 statements into 10 equivalence classes.
[2025-05-07 17:26:44,082 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 116 of 157 statements.
[2025-05-07 17:26:44,082 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2025-05-07 17:26:44,082 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:44,084 INFO  L256         TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 37 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:44,086 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:44,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 546 backedges. 156 proven. 50 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked.
[2025-05-07 17:26:44,277 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:26:48,270 INFO  L134       CoverageAnalysis]: Checked inductivity of 546 backedges. 161 proven. 52 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked.
[2025-05-07 17:26:48,270 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778132067] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:26:48,270 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:26:48,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 27] total 44
[2025-05-07 17:26:48,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437146443]
[2025-05-07 17:26:48,270 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:26:48,271 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 44 states
[2025-05-07 17:26:48,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:48,271 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2025-05-07 17:26:48,271 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1724, Unknown=0, NotChecked=0, Total=1892
[2025-05-07 17:26:48,272 INFO  L87              Difference]: Start difference. First operand 94 states and 122 transitions. Second operand  has 44 states, 22 states have (on average 2.590909090909091) internal successors, (57), 42 states have internal predecessors, (57), 26 states have call successors, (55), 2 states have call predecessors, (55), 22 states have return successors, (65), 35 states have call predecessors, (65), 26 states have call successors, (65)
[2025-05-07 17:26:48,670 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:48,670 INFO  L93              Difference]: Finished difference Result 106 states and 140 transitions.
[2025-05-07 17:26:48,671 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-05-07 17:26:48,671 INFO  L79                 Accepts]: Start accepts. Automaton has  has 44 states, 22 states have (on average 2.590909090909091) internal successors, (57), 42 states have internal predecessors, (57), 26 states have call successors, (55), 2 states have call predecessors, (55), 22 states have return successors, (65), 35 states have call predecessors, (65), 26 states have call successors, (65) Word has length 157
[2025-05-07 17:26:48,671 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:48,672 INFO  L225             Difference]: With dead ends: 106
[2025-05-07 17:26:48,672 INFO  L226             Difference]: Without dead ends: 99
[2025-05-07 17:26:48,672 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 291 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=286, Invalid=2684, Unknown=0, NotChecked=0, Total=2970
[2025-05-07 17:26:48,673 INFO  L437           NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:48,673 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 972 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:26:48,673 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2025-05-07 17:26:48,676 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92.
[2025-05-07 17:26:48,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 29 states have call successors, (29), 19 states have call predecessors, (29), 23 states have return successors, (47), 33 states have call predecessors, (47), 29 states have call successors, (47)
[2025-05-07 17:26:48,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 117 transitions.
[2025-05-07 17:26:48,677 INFO  L79                 Accepts]: Start accepts. Automaton has 92 states and 117 transitions. Word has length 157
[2025-05-07 17:26:48,677 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:48,677 INFO  L485      AbstractCegarLoop]: Abstraction has 92 states and 117 transitions.
[2025-05-07 17:26:48,677 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 44 states, 22 states have (on average 2.590909090909091) internal successors, (57), 42 states have internal predecessors, (57), 26 states have call successors, (55), 2 states have call predecessors, (55), 22 states have return successors, (65), 35 states have call predecessors, (65), 26 states have call successors, (65)
[2025-05-07 17:26:48,677 INFO  L278                IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions.
[2025-05-07 17:26:48,678 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-05-07 17:26:48,678 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:48,678 INFO  L218           NwaCegarLoop]: trace histogram [23, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:48,683 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2025-05-07 17:26:48,879 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-05-07 17:26:48,879 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:48,880 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:48,880 INFO  L85        PathProgramCache]: Analyzing trace with hash 406861053, now seen corresponding path program 10 times
[2025-05-07 17:26:48,880 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:48,881 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903835074]
[2025-05-07 17:26:48,881 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:26:48,881 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:48,944 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 206 statements into 2 equivalence classes.
[2025-05-07 17:26:48,955 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 205 of 206 statements.
[2025-05-07 17:26:48,955 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-05-07 17:26:48,955 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:49,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 1271 backedges. 261 proven. 285 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked.
[2025-05-07 17:26:49,531 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:49,531 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903835074]
[2025-05-07 17:26:49,531 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903835074] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:49,531 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818471659]
[2025-05-07 17:26:49,531 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:26:49,531 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:49,532 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:49,534 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:49,535 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-05-07 17:26:49,924 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 206 statements into 2 equivalence classes.
[2025-05-07 17:26:49,995 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 205 of 206 statements.
[2025-05-07 17:26:49,995 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-05-07 17:26:49,995 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:49,998 INFO  L256         TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 35 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:50,000 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:50,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 1271 backedges. 253 proven. 286 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked.
[2025-05-07 17:26:50,133 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:26:54,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 1271 backedges. 264 proven. 289 refuted. 0 times theorem prover too weak. 718 trivial. 0 not checked.
[2025-05-07 17:26:54,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [818471659] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:26:54,867 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:26:54,867 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 24] total 31
[2025-05-07 17:26:54,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100502864]
[2025-05-07 17:26:54,867 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:26:54,867 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2025-05-07 17:26:54,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:54,868 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2025-05-07 17:26:54,868 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930
[2025-05-07 17:26:54,868 INFO  L87              Difference]: Start difference. First operand 92 states and 117 transitions. Second operand  has 31 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 30 states have internal predecessors, (55), 25 states have call successors, (47), 2 states have call predecessors, (47), 14 states have return successors, (57), 14 states have call predecessors, (57), 25 states have call successors, (57)
[2025-05-07 17:26:55,165 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:55,165 INFO  L93              Difference]: Finished difference Result 101 states and 138 transitions.
[2025-05-07 17:26:55,166 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-05-07 17:26:55,166 INFO  L79                 Accepts]: Start accepts. Automaton has  has 31 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 30 states have internal predecessors, (55), 25 states have call successors, (47), 2 states have call predecessors, (47), 14 states have return successors, (57), 14 states have call predecessors, (57), 25 states have call successors, (57) Word has length 206
[2025-05-07 17:26:55,166 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:55,167 INFO  L225             Difference]: With dead ends: 101
[2025-05-07 17:26:55,167 INFO  L226             Difference]: Without dead ends: 101
[2025-05-07 17:26:55,167 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 400 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=1294, Unknown=0, NotChecked=0, Total=1560
[2025-05-07 17:26:55,167 INFO  L437           NwaCegarLoop]: 58 mSDtfsCounter, 27 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:55,168 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 842 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:26:55,168 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2025-05-07 17:26:55,170 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87.
[2025-05-07 17:26:55,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 87 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 30 states have call successors, (30), 21 states have call predecessors, (30), 19 states have return successors, (42), 28 states have call predecessors, (42), 30 states have call successors, (42)
[2025-05-07 17:26:55,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions.
[2025-05-07 17:26:55,171 INFO  L79                 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 206
[2025-05-07 17:26:55,171 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:55,171 INFO  L485      AbstractCegarLoop]: Abstraction has 87 states and 111 transitions.
[2025-05-07 17:26:55,172 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 30 states have internal predecessors, (55), 25 states have call successors, (47), 2 states have call predecessors, (47), 14 states have return successors, (57), 14 states have call predecessors, (57), 25 states have call successors, (57)
[2025-05-07 17:26:55,172 INFO  L278                IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions.
[2025-05-07 17:26:55,173 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 267
[2025-05-07 17:26:55,173 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:55,173 INFO  L218           NwaCegarLoop]: trace histogram [31, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:55,180 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2025-05-07 17:26:55,374 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-05-07 17:26:55,374 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:55,375 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:55,376 INFO  L85        PathProgramCache]: Analyzing trace with hash -1575276807, now seen corresponding path program 11 times
[2025-05-07 17:26:55,376 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:55,376 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749626399]
[2025-05-07 17:26:55,376 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-05-07 17:26:55,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:55,445 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 266 statements into 19 equivalence classes.
[2025-05-07 17:26:55,488 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) and asserted 266 of 266 statements.
[2025-05-07 17:26:55,488 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s)
[2025-05-07 17:26:55,488 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:57,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 2357 backedges. 288 proven. 768 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked.
[2025-05-07 17:26:57,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:57,184 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749626399]
[2025-05-07 17:26:57,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749626399] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:26:57,184 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404020513]
[2025-05-07 17:26:57,184 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-05-07 17:26:57,184 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:26:57,185 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:57,187 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:26:57,187 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2025-05-07 17:26:57,616 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 266 statements into 19 equivalence classes.
[2025-05-07 17:26:57,736 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) and asserted 266 of 266 statements.
[2025-05-07 17:26:57,736 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s)
[2025-05-07 17:26:57,736 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:57,740 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 37 conjuncts are in the unsatisfiable core
[2025-05-07 17:26:57,743 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:26:57,968 INFO  L134       CoverageAnalysis]: Checked inductivity of 2357 backedges. 398 proven. 178 refuted. 0 times theorem prover too weak. 1781 trivial. 0 not checked.
[2025-05-07 17:26:57,968 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:27:03,652 INFO  L134       CoverageAnalysis]: Checked inductivity of 2357 backedges. 411 proven. 169 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked.
[2025-05-07 17:27:03,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [404020513] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:27:03,653 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:27:03,653 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 27] total 48
[2025-05-07 17:27:03,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744782594]
[2025-05-07 17:27:03,653 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:27:03,654 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 48 states
[2025-05-07 17:27:03,654 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:03,655 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2025-05-07 17:27:03,656 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2072, Unknown=0, NotChecked=0, Total=2256
[2025-05-07 17:27:03,656 INFO  L87              Difference]: Start difference. First operand 87 states and 111 transitions. Second operand  has 48 states, 25 states have (on average 2.32) internal successors, (58), 43 states have internal predecessors, (58), 29 states have call successors, (56), 2 states have call predecessors, (56), 25 states have return successors, (70), 36 states have call predecessors, (70), 29 states have call successors, (70)
[2025-05-07 17:27:04,373 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:04,374 INFO  L93              Difference]: Finished difference Result 103 states and 143 transitions.
[2025-05-07 17:27:04,374 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2025-05-07 17:27:04,374 INFO  L79                 Accepts]: Start accepts. Automaton has  has 48 states, 25 states have (on average 2.32) internal successors, (58), 43 states have internal predecessors, (58), 29 states have call successors, (56), 2 states have call predecessors, (56), 25 states have return successors, (70), 36 states have call predecessors, (70), 29 states have call successors, (70) Word has length 266
[2025-05-07 17:27:04,374 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:04,375 INFO  L225             Difference]: With dead ends: 103
[2025-05-07 17:27:04,375 INFO  L226             Difference]: Without dead ends: 101
[2025-05-07 17:27:04,376 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 526 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=381, Invalid=3651, Unknown=0, NotChecked=0, Total=4032
[2025-05-07 17:27:04,376 INFO  L437           NwaCegarLoop]: 55 mSDtfsCounter, 49 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:04,376 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1360 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:27:04,377 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2025-05-07 17:27:04,379 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92.
[2025-05-07 17:27:04,379 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 40 states have (on average 1.05) internal successors, (42), 39 states have internal predecessors, (42), 30 states have call successors, (30), 22 states have call predecessors, (30), 21 states have return successors, (44), 30 states have call predecessors, (44), 30 states have call successors, (44)
[2025-05-07 17:27:04,380 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions.
[2025-05-07 17:27:04,380 INFO  L79                 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 266
[2025-05-07 17:27:04,380 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:04,380 INFO  L485      AbstractCegarLoop]: Abstraction has 92 states and 116 transitions.
[2025-05-07 17:27:04,380 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 48 states, 25 states have (on average 2.32) internal successors, (58), 43 states have internal predecessors, (58), 29 states have call successors, (56), 2 states have call predecessors, (56), 25 states have return successors, (70), 36 states have call predecessors, (70), 29 states have call successors, (70)
[2025-05-07 17:27:04,380 INFO  L278                IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions.
[2025-05-07 17:27:04,381 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 278
[2025-05-07 17:27:04,381 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:04,381 INFO  L218           NwaCegarLoop]: trace histogram [31, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:04,389 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2025-05-07 17:27:04,582 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:04,582 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:04,583 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:04,583 INFO  L85        PathProgramCache]: Analyzing trace with hash 1431333678, now seen corresponding path program 12 times
[2025-05-07 17:27:04,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:04,584 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007995045]
[2025-05-07 17:27:04,584 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-05-07 17:27:04,584 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:04,642 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 277 statements into 19 equivalence classes.
[2025-05-07 17:27:04,684 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) and asserted 277 of 277 statements.
[2025-05-07 17:27:04,685 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s)
[2025-05-07 17:27:04,685 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:10,045 INFO  L134       CoverageAnalysis]: Checked inductivity of 2382 backedges. 313 proven. 944 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked.
[2025-05-07 17:27:10,045 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:10,045 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007995045]
[2025-05-07 17:27:10,045 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007995045] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:27:10,045 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661396779]
[2025-05-07 17:27:10,045 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-05-07 17:27:10,045 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:10,048 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:10,049 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:27:10,050 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2025-05-07 17:27:10,523 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 277 statements into 19 equivalence classes.
[2025-05-07 17:27:10,663 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) and asserted 277 of 277 statements.
[2025-05-07 17:27:10,663 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s)
[2025-05-07 17:27:10,663 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:10,670 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 273 conjuncts are in the unsatisfiable core
[2025-05-07 17:27:10,677 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:27:10,685 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2025-05-07 17:27:11,580 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9
[2025-05-07 17:27:11,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 2382 backedges. 291 proven. 945 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked.
[2025-05-07 17:27:11,745 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:27:40,604 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:27:40,604 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:27:40,606 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:27:42,343 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:27:42,343 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:27:42,345 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:27:43,714 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:27:43,714 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:27:43,716 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:27:43,737 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:27:43,738 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:27:44,311 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:27:44,311 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:27:44,313 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:27:45,861 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:27:45,862 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:27:45,879 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:27:45,880 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:27:45,912 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:27:45,912 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:27:45,914 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:27:47,732 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:27:47,732 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:27:47,734 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:27:48,739 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:27:48,740 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:27:48,755 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:27:48,755 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:27:48,757 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:27:49,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 2382 backedges. 291 proven. 983 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked.
[2025-05-07 17:27:49,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [661396779] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:27:49,530 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:27:49,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33, 40] total 69
[2025-05-07 17:27:49,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890733854]
[2025-05-07 17:27:49,530 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:27:49,530 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 69 states
[2025-05-07 17:27:49,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:49,531 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants.
[2025-05-07 17:27:49,531 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=4445, Unknown=0, NotChecked=0, Total=4692
[2025-05-07 17:27:49,532 INFO  L87              Difference]: Start difference. First operand 92 states and 116 transitions. Second operand  has 69 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 54 states have internal predecessors, (65), 42 states have call successors, (67), 2 states have call predecessors, (67), 30 states have return successors, (86), 48 states have call predecessors, (86), 42 states have call successors, (86)
[2025-05-07 17:27:51,377 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:51,377 INFO  L93              Difference]: Finished difference Result 135 states and 192 transitions.
[2025-05-07 17:27:51,377 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. 
[2025-05-07 17:27:51,377 INFO  L79                 Accepts]: Start accepts. Automaton has  has 69 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 54 states have internal predecessors, (65), 42 states have call successors, (67), 2 states have call predecessors, (67), 30 states have return successors, (86), 48 states have call predecessors, (86), 42 states have call successors, (86) Word has length 277
[2025-05-07 17:27:51,378 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:51,378 INFO  L225             Difference]: With dead ends: 135
[2025-05-07 17:27:51,378 INFO  L226             Difference]: Without dead ends: 135
[2025-05-07 17:27:51,380 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 565 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2031 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=652, Invalid=8278, Unknown=0, NotChecked=0, Total=8930
[2025-05-07 17:27:51,380 INFO  L437           NwaCegarLoop]: 51 mSDtfsCounter, 121 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:51,380 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1830 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-05-07 17:27:51,381 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 135 states.
[2025-05-07 17:27:51,385 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 107.
[2025-05-07 17:27:51,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 45 states have internal predecessors, (48), 33 states have call successors, (33), 22 states have call predecessors, (33), 27 states have return successors, (62), 39 states have call predecessors, (62), 33 states have call successors, (62)
[2025-05-07 17:27:51,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions.
[2025-05-07 17:27:51,385 INFO  L79                 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 277
[2025-05-07 17:27:51,386 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:51,386 INFO  L485      AbstractCegarLoop]: Abstraction has 107 states and 143 transitions.
[2025-05-07 17:27:51,386 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 69 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 54 states have internal predecessors, (65), 42 states have call successors, (67), 2 states have call predecessors, (67), 30 states have return successors, (86), 48 states have call predecessors, (86), 42 states have call successors, (86)
[2025-05-07 17:27:51,386 INFO  L278                IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions.
[2025-05-07 17:27:51,387 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 398
[2025-05-07 17:27:51,387 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:51,387 INFO  L218           NwaCegarLoop]: trace histogram [47, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:51,394 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2025-05-07 17:27:51,588 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:51,588 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:51,589 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:51,590 INFO  L85        PathProgramCache]: Analyzing trace with hash -1057591626, now seen corresponding path program 13 times
[2025-05-07 17:27:51,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:51,590 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826402933]
[2025-05-07 17:27:51,591 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-05-07 17:27:51,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:51,664 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes.
[2025-05-07 17:27:51,682 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements.
[2025-05-07 17:27:51,682 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:51,682 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:53,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 5562 backedges. 555 proven. 1111 refuted. 0 times theorem prover too weak. 3896 trivial. 0 not checked.
[2025-05-07 17:27:53,104 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:53,104 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826402933]
[2025-05-07 17:27:53,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826402933] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:27:53,104 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142297394]
[2025-05-07 17:27:53,104 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-05-07 17:27:53,104 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:53,107 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:53,108 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:27:53,109 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2025-05-07 17:27:54,043 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes.
[2025-05-07 17:27:54,211 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements.
[2025-05-07 17:27:54,211 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:54,211 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:54,217 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1913 conjuncts, 45 conjuncts are in the unsatisfiable core
[2025-05-07 17:27:54,221 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:27:54,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 5562 backedges. 551 proven. 1104 refuted. 0 times theorem prover too weak. 3907 trivial. 0 not checked.
[2025-05-07 17:27:54,376 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:03,981 INFO  L134       CoverageAnalysis]: Checked inductivity of 5562 backedges. 558 proven. 1127 refuted. 0 times theorem prover too weak. 3877 trivial. 0 not checked.
[2025-05-07 17:28:03,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [142297394] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:03,981 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:03,981 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 32] total 40
[2025-05-07 17:28:03,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407592081]
[2025-05-07 17:28:03,982 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:03,982 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2025-05-07 17:28:03,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:03,983 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2025-05-07 17:28:03,983 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1368, Unknown=0, NotChecked=0, Total=1560
[2025-05-07 17:28:03,983 INFO  L87              Difference]: Start difference. First operand 107 states and 143 transitions. Second operand  has 40 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 39 states have internal predecessors, (64), 32 states have call successors, (56), 2 states have call predecessors, (56), 18 states have return successors, (72), 18 states have call predecessors, (72), 32 states have call successors, (72)
[2025-05-07 17:28:04,527 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:04,527 INFO  L93              Difference]: Finished difference Result 129 states and 184 transitions.
[2025-05-07 17:28:04,527 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2025-05-07 17:28:04,528 INFO  L79                 Accepts]: Start accepts. Automaton has  has 40 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 39 states have internal predecessors, (64), 32 states have call successors, (56), 2 states have call predecessors, (56), 18 states have return successors, (72), 18 states have call predecessors, (72), 32 states have call successors, (72) Word has length 397
[2025-05-07 17:28:04,528 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:04,529 INFO  L225             Difference]: With dead ends: 129
[2025-05-07 17:28:04,529 INFO  L226             Difference]: Without dead ends: 129
[2025-05-07 17:28:04,529 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 779 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=464, Invalid=2506, Unknown=0, NotChecked=0, Total=2970
[2025-05-07 17:28:04,529 INFO  L437           NwaCegarLoop]: 59 mSDtfsCounter, 68 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:04,530 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 946 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:04,530 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2025-05-07 17:28:04,534 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121.
[2025-05-07 17:28:04,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 121 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 51 states have internal predecessors, (54), 41 states have call successors, (41), 28 states have call predecessors, (41), 27 states have return successors, (69), 41 states have call predecessors, (69), 41 states have call successors, (69)
[2025-05-07 17:28:04,534 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 164 transitions.
[2025-05-07 17:28:04,535 INFO  L79                 Accepts]: Start accepts. Automaton has 121 states and 164 transitions. Word has length 397
[2025-05-07 17:28:04,535 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:04,535 INFO  L485      AbstractCegarLoop]: Abstraction has 121 states and 164 transitions.
[2025-05-07 17:28:04,535 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 39 states have internal predecessors, (64), 32 states have call successors, (56), 2 states have call predecessors, (56), 18 states have return successors, (72), 18 states have call predecessors, (72), 32 states have call successors, (72)
[2025-05-07 17:28:04,535 INFO  L278                IsEmpty]: Start isEmpty. Operand 121 states and 164 transitions.
[2025-05-07 17:28:04,536 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 289
[2025-05-07 17:28:04,536 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:04,536 INFO  L218           NwaCegarLoop]: trace histogram [31, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:04,544 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2025-05-07 17:28:04,737 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2025-05-07 17:28:04,737 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:04,738 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:04,738 INFO  L85        PathProgramCache]: Analyzing trace with hash 1573287265, now seen corresponding path program 14 times
[2025-05-07 17:28:04,739 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:04,739 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301877919]
[2025-05-07 17:28:04,739 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:04,739 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:04,802 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 288 statements into 2 equivalence classes.
[2025-05-07 17:28:04,815 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 288 of 288 statements.
[2025-05-07 17:28:04,815 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:04,815 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:05,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 2418 backedges. 150 proven. 454 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked.
[2025-05-07 17:28:05,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:05,935 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301877919]
[2025-05-07 17:28:05,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301877919] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:05,935 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64692345]
[2025-05-07 17:28:05,935 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:05,935 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:05,937 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:05,939 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:05,939 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2025-05-07 17:28:07,007 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 288 statements into 2 equivalence classes.
[2025-05-07 17:28:07,104 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 288 of 288 statements.
[2025-05-07 17:28:07,104 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:07,104 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:07,108 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 47 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:07,111 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:07,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 2418 backedges. 144 proven. 460 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked.
[2025-05-07 17:28:07,337 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:15,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 2418 backedges. 153 proven. 466 refuted. 0 times theorem prover too weak. 1799 trivial. 0 not checked.
[2025-05-07 17:28:15,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [64692345] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:15,626 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:15,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 35] total 45
[2025-05-07 17:28:15,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473809774]
[2025-05-07 17:28:15,626 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:15,626 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 45 states
[2025-05-07 17:28:15,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:15,627 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants.
[2025-05-07 17:28:15,627 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1788, Unknown=0, NotChecked=0, Total=1980
[2025-05-07 17:28:15,627 INFO  L87              Difference]: Start difference. First operand 121 states and 164 transitions. Second operand  has 45 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 44 states have internal predecessors, (58), 30 states have call successors, (50), 2 states have call predecessors, (50), 22 states have return successors, (65), 28 states have call predecessors, (65), 30 states have call successors, (65)
[2025-05-07 17:28:15,958 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:15,958 INFO  L93              Difference]: Finished difference Result 125 states and 174 transitions.
[2025-05-07 17:28:15,959 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-05-07 17:28:15,959 INFO  L79                 Accepts]: Start accepts. Automaton has  has 45 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 44 states have internal predecessors, (58), 30 states have call successors, (50), 2 states have call predecessors, (50), 22 states have return successors, (65), 28 states have call predecessors, (65), 30 states have call successors, (65) Word has length 288
[2025-05-07 17:28:15,959 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:15,960 INFO  L225             Difference]: With dead ends: 125
[2025-05-07 17:28:15,960 INFO  L226             Difference]: Without dead ends: 118
[2025-05-07 17:28:15,961 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 556 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=341, Invalid=2851, Unknown=0, NotChecked=0, Total=3192
[2025-05-07 17:28:15,961 INFO  L437           NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:15,961 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 937 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:15,962 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2025-05-07 17:28:15,965 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110.
[2025-05-07 17:28:15,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 110 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 47 states have internal predecessors, (50), 38 states have call successors, (38), 28 states have call predecessors, (38), 23 states have return successors, (60), 34 states have call predecessors, (60), 38 states have call successors, (60)
[2025-05-07 17:28:15,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions.
[2025-05-07 17:28:15,966 INFO  L79                 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 288
[2025-05-07 17:28:15,966 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:15,966 INFO  L485      AbstractCegarLoop]: Abstraction has 110 states and 148 transitions.
[2025-05-07 17:28:15,966 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 45 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 44 states have internal predecessors, (58), 30 states have call successors, (50), 2 states have call predecessors, (50), 22 states have return successors, (65), 28 states have call predecessors, (65), 30 states have call successors, (65)
[2025-05-07 17:28:15,966 INFO  L278                IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions.
[2025-05-07 17:28:15,967 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 398
[2025-05-07 17:28:15,967 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:15,967 INFO  L218           NwaCegarLoop]: trace histogram [47, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:15,979 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0
[2025-05-07 17:28:16,168 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2025-05-07 17:28:16,169 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:16,169 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:16,170 INFO  L85        PathProgramCache]: Analyzing trace with hash -1433966666, now seen corresponding path program 15 times
[2025-05-07 17:28:16,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:16,170 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925222701]
[2025-05-07 17:28:16,170 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:28:16,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:16,239 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 397 statements into 29 equivalence classes.
[2025-05-07 17:28:16,271 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 278 of 397 statements.
[2025-05-07 17:28:16,272 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s)
[2025-05-07 17:28:16,272 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:17,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 5562 backedges. 299 proven. 599 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked.
[2025-05-07 17:28:17,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:17,641 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925222701]
[2025-05-07 17:28:17,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925222701] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:17,641 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965486846]
[2025-05-07 17:28:17,641 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:28:17,641 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:17,643 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:17,644 INFO  L229       MonitoredProcess]: Starting monitored process 18 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:17,655 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process
[2025-05-07 17:28:18,887 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 397 statements into 29 equivalence classes.
[2025-05-07 17:28:19,033 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 278 of 397 statements.
[2025-05-07 17:28:19,033 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s)
[2025-05-07 17:28:19,033 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:19,038 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1392 conjuncts, 55 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:19,042 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:19,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 5562 backedges. 304 proven. 643 refuted. 0 times theorem prover too weak. 4615 trivial. 0 not checked.
[2025-05-07 17:28:19,239 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:24,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 5562 backedges. 307 proven. 652 refuted. 0 times theorem prover too weak. 4603 trivial. 0 not checked.
[2025-05-07 17:28:24,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [965486846] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:24,156 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:24,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24, 31] total 41
[2025-05-07 17:28:24,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803681644]
[2025-05-07 17:28:24,157 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:24,157 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 41 states
[2025-05-07 17:28:24,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:24,157 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2025-05-07 17:28:24,158 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640
[2025-05-07 17:28:24,158 INFO  L87              Difference]: Start difference. First operand 110 states and 148 transitions. Second operand  has 41 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 40 states have internal predecessors, (54), 27 states have call successors, (43), 2 states have call predecessors, (43), 21 states have return successors, (54), 25 states have call predecessors, (54), 27 states have call successors, (54)
[2025-05-07 17:28:24,624 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:24,624 INFO  L93              Difference]: Finished difference Result 118 states and 163 transitions.
[2025-05-07 17:28:24,624 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-05-07 17:28:24,625 INFO  L79                 Accepts]: Start accepts. Automaton has  has 41 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 40 states have internal predecessors, (54), 27 states have call successors, (43), 2 states have call predecessors, (43), 21 states have return successors, (54), 25 states have call predecessors, (54), 27 states have call successors, (54) Word has length 397
[2025-05-07 17:28:24,625 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:24,626 INFO  L225             Difference]: With dead ends: 118
[2025-05-07 17:28:24,626 INFO  L226             Difference]: Without dead ends: 118
[2025-05-07 17:28:24,627 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=2692, Unknown=0, NotChecked=0, Total=2970
[2025-05-07 17:28:24,628 INFO  L437           NwaCegarLoop]: 61 mSDtfsCounter, 18 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:24,628 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1420 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:24,629 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2025-05-07 17:28:24,632 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114.
[2025-05-07 17:28:24,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 38 states have call successors, (38), 28 states have call predecessors, (38), 25 states have return successors, (62), 36 states have call predecessors, (62), 38 states have call successors, (62)
[2025-05-07 17:28:24,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions.
[2025-05-07 17:28:24,633 INFO  L79                 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 397
[2025-05-07 17:28:24,633 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:24,633 INFO  L485      AbstractCegarLoop]: Abstraction has 114 states and 152 transitions.
[2025-05-07 17:28:24,633 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 41 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 40 states have internal predecessors, (54), 27 states have call successors, (43), 2 states have call predecessors, (43), 21 states have return successors, (54), 25 states have call predecessors, (54), 27 states have call successors, (54)
[2025-05-07 17:28:24,633 INFO  L278                IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions.
[2025-05-07 17:28:24,635 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 529
[2025-05-07 17:28:24,635 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:24,635 INFO  L218           NwaCegarLoop]: trace histogram [63, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:24,644 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0
[2025-05-07 17:28:24,836 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2025-05-07 17:28:24,836 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:24,837 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:24,838 INFO  L85        PathProgramCache]: Analyzing trace with hash -1717157039, now seen corresponding path program 16 times
[2025-05-07 17:28:24,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:24,838 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073278929]
[2025-05-07 17:28:24,838 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:28:24,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:24,915 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 528 statements into 2 equivalence classes.
[2025-05-07 17:28:24,958 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 528 of 528 statements.
[2025-05-07 17:28:24,958 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-05-07 17:28:24,958 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:46,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 10122 backedges. 991 proven. 4070 refuted. 0 times theorem prover too weak. 5061 trivial. 0 not checked.
[2025-05-07 17:28:46,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:46,150 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073278929]
[2025-05-07 17:28:46,150 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073278929] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:46,150 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790456704]
[2025-05-07 17:28:46,151 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:28:46,151 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:46,153 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:46,154 INFO  L229       MonitoredProcess]: Starting monitored process 19 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:46,155 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process
[2025-05-07 17:28:47,428 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 528 statements into 2 equivalence classes.
[2025-05-07 17:28:47,588 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 528 of 528 statements.
[2025-05-07 17:28:47,588 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-05-07 17:28:47,588 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:47,601 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2551 conjuncts, 509 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:47,613 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:47,618 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2025-05-07 17:28:48,764 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9
[2025-05-07 17:28:49,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 10122 backedges. 977 proven. 4070 refuted. 0 times theorem prover too weak. 5075 trivial. 0 not checked.
[2025-05-07 17:28:49,038 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:30:15,516 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:15,516 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:15,518 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:22,234 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:22,234 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:22,236 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:23,968 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:23,968 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:23,971 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:25,402 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:25,402 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:25,404 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:25,435 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:30:25,435 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:30:25,473 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:25,474 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:30:28,209 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:28,210 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:30:28,231 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:30:28,231 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:30:28,253 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:28,254 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:28,255 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:30,202 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:30,202 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:30,204 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:31,160 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:31,160 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:30:31,176 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:30:31,176 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:30:31,197 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:31,197 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:31,199 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:37,700 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:37,700 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:30:37,716 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:30:37,716 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:30:37,732 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:37,732 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:37,734 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:44,237 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:44,238 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:44,240 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:45,912 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:45,912 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:45,914 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:46,910 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:46,910 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:46,911 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:46,921 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:46,921 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:30:46,938 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:30:46,938 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:30:49,499 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:30:49,499 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:30:49,541 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:49,541 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:30:49,547 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:49,547 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:49,549 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:51,939 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:51,939 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:51,941 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:53,272 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:30:53,273 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:30:53,290 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:53,290 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:30:53,296 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:30:53,296 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:30:53,298 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:30:53,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 10122 backedges. 977 proven. 4234 refuted. 0 times theorem prover too weak. 4911 trivial. 0 not checked.
[2025-05-07 17:30:53,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790456704] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:30:53,962 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:30:53,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 49] total 76
[2025-05-07 17:30:53,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834001122]
[2025-05-07 17:30:53,963 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:30:53,963 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 76 states
[2025-05-07 17:30:53,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:53,964 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants.
[2025-05-07 17:30:53,964 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=5392, Unknown=0, NotChecked=0, Total=5700
[2025-05-07 17:30:53,964 INFO  L87              Difference]: Start difference. First operand 114 states and 152 transitions. Second operand  has 76 states, 37 states have (on average 1.972972972972973) internal successors, (73), 62 states have internal predecessors, (73), 42 states have call successors, (64), 2 states have call predecessors, (64), 37 states have return successors, (88), 53 states have call predecessors, (88), 42 states have call successors, (88)
[2025-05-07 17:30:55,781 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:55,781 INFO  L93              Difference]: Finished difference Result 164 states and 241 transitions.
[2025-05-07 17:30:55,782 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2025-05-07 17:30:55,782 INFO  L79                 Accepts]: Start accepts. Automaton has  has 76 states, 37 states have (on average 1.972972972972973) internal successors, (73), 62 states have internal predecessors, (73), 42 states have call successors, (64), 2 states have call predecessors, (64), 37 states have return successors, (88), 53 states have call predecessors, (88), 42 states have call successors, (88) Word has length 528
[2025-05-07 17:30:55,783 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:55,784 INFO  L225             Difference]: With dead ends: 164
[2025-05-07 17:30:55,784 INFO  L226             Difference]: Without dead ends: 164
[2025-05-07 17:30:55,785 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 1238 GetRequests, 1130 SyntacticMatches, 11 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=638, Invalid=9064, Unknown=0, NotChecked=0, Total=9702
[2025-05-07 17:30:55,785 INFO  L437           NwaCegarLoop]: 68 mSDtfsCounter, 84 mSDsluCounter, 2780 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:55,786 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 2848 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-05-07 17:30:55,786 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2025-05-07 17:30:55,791 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 129.
[2025-05-07 17:30:55,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 55 states have internal predecessors, (58), 41 states have call successors, (41), 28 states have call predecessors, (41), 31 states have return successors, (81), 45 states have call predecessors, (81), 41 states have call successors, (81)
[2025-05-07 17:30:55,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 180 transitions.
[2025-05-07 17:30:55,792 INFO  L79                 Accepts]: Start accepts. Automaton has 129 states and 180 transitions. Word has length 528
[2025-05-07 17:30:55,792 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:55,792 INFO  L485      AbstractCegarLoop]: Abstraction has 129 states and 180 transitions.
[2025-05-07 17:30:55,792 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 76 states, 37 states have (on average 1.972972972972973) internal successors, (73), 62 states have internal predecessors, (73), 42 states have call successors, (64), 2 states have call predecessors, (64), 37 states have return successors, (88), 53 states have call predecessors, (88), 42 states have call successors, (88)
[2025-05-07 17:30:55,793 INFO  L278                IsEmpty]: Start isEmpty. Operand 129 states and 180 transitions.
[2025-05-07 17:30:55,794 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 409
[2025-05-07 17:30:55,794 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:55,794 INFO  L218           NwaCegarLoop]: trace histogram [47, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:55,808 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0
[2025-05-07 17:30:55,994 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2025-05-07 17:30:55,994 INFO  L403      AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:55,995 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:55,995 INFO  L85        PathProgramCache]: Analyzing trace with hash -1074146343, now seen corresponding path program 17 times
[2025-05-07 17:30:55,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:55,995 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169166358]
[2025-05-07 17:30:55,995 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-05-07 17:30:55,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:56,051 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 408 statements into 29 equivalence classes.
[2025-05-07 17:30:56,103 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) and asserted 344 of 408 statements.
[2025-05-07 17:30:56,103 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s)
[2025-05-07 17:30:56,103 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:58,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 5598 backedges. 741 proven. 1689 refuted. 0 times theorem prover too weak. 3168 trivial. 0 not checked.
[2025-05-07 17:30:58,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:58,483 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169166358]
[2025-05-07 17:30:58,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169166358] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:30:58,483 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160270194]
[2025-05-07 17:30:58,483 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-05-07 17:30:58,483 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:30:58,485 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:30:58,486 INFO  L229       MonitoredProcess]: Starting monitored process 20 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:30:58,487 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process
[2025-05-07 17:31:00,282 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 408 statements into 29 equivalence classes.
[2025-05-07 17:31:00,469 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) and asserted 344 of 408 statements.
[2025-05-07 17:31:00,469 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s)
[2025-05-07 17:31:00,469 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:00,475 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 45 conjuncts are in the unsatisfiable core
[2025-05-07 17:31:00,479 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:31:00,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 5598 backedges. 1016 proven. 643 refuted. 0 times theorem prover too weak. 3939 trivial. 0 not checked.
[2025-05-07 17:31:00,657 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:31:10,511 INFO  L134       CoverageAnalysis]: Checked inductivity of 5598 backedges. 1029 proven. 656 refuted. 0 times theorem prover too weak. 3913 trivial. 0 not checked.
[2025-05-07 17:31:10,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160270194] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:31:10,512 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:31:10,512 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 32] total 49
[2025-05-07 17:31:10,512 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820915756]
[2025-05-07 17:31:10,512 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:31:10,512 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2025-05-07 17:31:10,513 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:31:10,513 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2025-05-07 17:31:10,513 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2099, Unknown=0, NotChecked=0, Total=2352
[2025-05-07 17:31:10,513 INFO  L87              Difference]: Start difference. First operand 129 states and 180 transitions. Second operand  has 49 states, 25 states have (on average 2.84) internal successors, (71), 45 states have internal predecessors, (71), 33 states have call successors, (68), 2 states have call predecessors, (68), 25 states have return successors, (89), 33 states have call predecessors, (89), 33 states have call successors, (89)
[2025-05-07 17:31:11,111 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:31:11,111 INFO  L93              Difference]: Finished difference Result 137 states and 201 transitions.
[2025-05-07 17:31:11,111 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2025-05-07 17:31:11,112 INFO  L79                 Accepts]: Start accepts. Automaton has  has 49 states, 25 states have (on average 2.84) internal successors, (71), 45 states have internal predecessors, (71), 33 states have call successors, (68), 2 states have call predecessors, (68), 25 states have return successors, (89), 33 states have call predecessors, (89), 33 states have call successors, (89) Word has length 408
[2025-05-07 17:31:11,112 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:31:11,113 INFO  L225             Difference]: With dead ends: 137
[2025-05-07 17:31:11,113 INFO  L226             Difference]: Without dead ends: 137
[2025-05-07 17:31:11,113 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 818 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=500, Invalid=3160, Unknown=0, NotChecked=0, Total=3660
[2025-05-07 17:31:11,114 INFO  L437           NwaCegarLoop]: 65 mSDtfsCounter, 59 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:31:11,114 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1057 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:31:11,114 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 137 states.
[2025-05-07 17:31:11,118 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133.
[2025-05-07 17:31:11,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 57 states have internal predecessors, (60), 43 states have call successors, (43), 30 states have call predecessors, (43), 31 states have return successors, (83), 45 states have call predecessors, (83), 43 states have call successors, (83)
[2025-05-07 17:31:11,119 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 186 transitions.
[2025-05-07 17:31:11,119 INFO  L79                 Accepts]: Start accepts. Automaton has 133 states and 186 transitions. Word has length 408
[2025-05-07 17:31:11,119 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:31:11,119 INFO  L485      AbstractCegarLoop]: Abstraction has 133 states and 186 transitions.
[2025-05-07 17:31:11,120 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 49 states, 25 states have (on average 2.84) internal successors, (71), 45 states have internal predecessors, (71), 33 states have call successors, (68), 2 states have call predecessors, (68), 25 states have return successors, (89), 33 states have call predecessors, (89), 33 states have call successors, (89)
[2025-05-07 17:31:11,120 INFO  L278                IsEmpty]: Start isEmpty. Operand 133 states and 186 transitions.
[2025-05-07 17:31:11,123 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 769
[2025-05-07 17:31:11,123 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:31:11,123 INFO  L218           NwaCegarLoop]: trace histogram [95, 48, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:31:11,142 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0
[2025-05-07 17:31:11,323 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2025-05-07 17:31:11,323 INFO  L403      AbstractCegarLoop]: === Iteration 25 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:31:11,325 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:31:11,325 INFO  L85        PathProgramCache]: Analyzing trace with hash 1836020033, now seen corresponding path program 18 times
[2025-05-07 17:31:11,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:31:11,325 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541641858]
[2025-05-07 17:31:11,325 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-05-07 17:31:11,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:31:11,401 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 768 statements into 63 equivalence classes.
[2025-05-07 17:31:11,573 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) and asserted 544 of 768 statements.
[2025-05-07 17:31:11,573 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s)
[2025-05-07 17:31:11,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:17,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 23202 backedges. 3383 proven. 1497 refuted. 0 times theorem prover too weak. 18322 trivial. 0 not checked.
[2025-05-07 17:31:17,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:31:17,966 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541641858]
[2025-05-07 17:31:17,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541641858] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:31:17,966 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760179855]
[2025-05-07 17:31:17,966 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-05-07 17:31:17,966 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:31:17,968 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:31:17,969 INFO  L229       MonitoredProcess]: Starting monitored process 21 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:31:17,970 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process
[2025-05-07 17:31:19,859 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 768 statements into 63 equivalence classes.
[2025-05-07 17:31:20,285 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) and asserted 544 of 768 statements.
[2025-05-07 17:31:20,286 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s)
[2025-05-07 17:31:20,286 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:20,296 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2687 conjuncts, 57 conjuncts are in the unsatisfiable core
[2025-05-07 17:31:20,301 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:31:20,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 23202 backedges. 2632 proven. 524 refuted. 0 times theorem prover too weak. 20046 trivial. 0 not checked.
[2025-05-07 17:31:20,910 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:31:40,758 INFO  L134       CoverageAnalysis]: Checked inductivity of 23202 backedges. 2645 proven. 547 refuted. 0 times theorem prover too weak. 20010 trivial. 0 not checked.
[2025-05-07 17:31:40,758 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760179855] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:31:40,758 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:31:40,759 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 32, 44] total 80
[2025-05-07 17:31:40,759 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795410240]
[2025-05-07 17:31:40,759 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:31:40,759 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 80 states
[2025-05-07 17:31:40,759 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:31:40,760 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants.
[2025-05-07 17:31:40,760 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=5914, Unknown=0, NotChecked=0, Total=6320
[2025-05-07 17:31:40,761 INFO  L87              Difference]: Start difference. First operand 133 states and 186 transitions. Second operand  has 80 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 72 states have internal predecessors, (87), 43 states have call successors, (84), 2 states have call predecessors, (84), 41 states have return successors, (110), 64 states have call predecessors, (110), 43 states have call successors, (110)
[2025-05-07 17:31:42,386 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:31:42,386 INFO  L93              Difference]: Finished difference Result 165 states and 275 transitions.
[2025-05-07 17:31:42,387 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. 
[2025-05-07 17:31:42,387 INFO  L79                 Accepts]: Start accepts. Automaton has  has 80 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 72 states have internal predecessors, (87), 43 states have call successors, (84), 2 states have call predecessors, (84), 41 states have return successors, (110), 64 states have call predecessors, (110), 43 states have call successors, (110) Word has length 768
[2025-05-07 17:31:42,388 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:31:42,389 INFO  L225             Difference]: With dead ends: 165
[2025-05-07 17:31:42,389 INFO  L226             Difference]: Without dead ends: 165
[2025-05-07 17:31:42,390 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 1623 GetRequests, 1509 SyntacticMatches, 13 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3652 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=849, Invalid=9657, Unknown=0, NotChecked=0, Total=10506
[2025-05-07 17:31:42,390 INFO  L437           NwaCegarLoop]: 77 mSDtfsCounter, 70 mSDsluCounter, 2973 mSDsCounter, 0 mSdLazyCounter, 2993 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 3160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 2993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:31:42,390 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 3050 Invalid, 3160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 2993 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-05-07 17:31:42,390 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 165 states.
[2025-05-07 17:31:42,395 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126.
[2025-05-07 17:31:42,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 126 states, 54 states have (on average 1.037037037037037) internal successors, (56), 53 states have internal predecessors, (56), 42 states have call successors, (42), 28 states have call predecessors, (42), 29 states have return successors, (79), 44 states have call predecessors, (79), 42 states have call successors, (79)
[2025-05-07 17:31:42,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 177 transitions.
[2025-05-07 17:31:42,395 INFO  L79                 Accepts]: Start accepts. Automaton has 126 states and 177 transitions. Word has length 768
[2025-05-07 17:31:42,396 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:31:42,396 INFO  L485      AbstractCegarLoop]: Abstraction has 126 states and 177 transitions.
[2025-05-07 17:31:42,396 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 80 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 72 states have internal predecessors, (87), 43 states have call successors, (84), 2 states have call predecessors, (84), 41 states have return successors, (110), 64 states have call predecessors, (110), 43 states have call successors, (110)
[2025-05-07 17:31:42,396 INFO  L278                IsEmpty]: Start isEmpty. Operand 126 states and 177 transitions.
[2025-05-07 17:31:42,398 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 540
[2025-05-07 17:31:42,398 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:31:42,398 INFO  L218           NwaCegarLoop]: trace histogram [63, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:31:42,421 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0
[2025-05-07 17:31:42,599 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2025-05-07 17:31:42,599 INFO  L403      AbstractCegarLoop]: === Iteration 26 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:31:42,600 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:31:42,600 INFO  L85        PathProgramCache]: Analyzing trace with hash 552910566, now seen corresponding path program 19 times
[2025-05-07 17:31:42,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:31:42,601 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721751866]
[2025-05-07 17:31:42,601 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-05-07 17:31:42,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:31:42,694 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes.
[2025-05-07 17:31:42,721 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements.
[2025-05-07 17:31:42,721 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:31:42,721 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:45,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 10169 backedges. 354 proven. 1224 refuted. 0 times theorem prover too weak. 8591 trivial. 0 not checked.
[2025-05-07 17:31:45,554 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:31:45,554 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721751866]
[2025-05-07 17:31:45,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721751866] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:31:45,554 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033825600]
[2025-05-07 17:31:45,554 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-05-07 17:31:45,554 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:31:45,556 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:31:45,557 INFO  L229       MonitoredProcess]: Starting monitored process 22 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:31:45,558 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process
[2025-05-07 17:31:48,135 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes.
[2025-05-07 17:31:48,322 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements.
[2025-05-07 17:31:48,322 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:31:48,322 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:48,330 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2605 conjuncts, 57 conjuncts are in the unsatisfiable core
[2025-05-07 17:31:48,337 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:31:48,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 10169 backedges. 346 proven. 1232 refuted. 0 times theorem prover too weak. 8591 trivial. 0 not checked.
[2025-05-07 17:31:48,550 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:32:03,923 INFO  L134       CoverageAnalysis]: Checked inductivity of 10169 backedges. 360 proven. 1248 refuted. 0 times theorem prover too weak. 8561 trivial. 0 not checked.
[2025-05-07 17:32:03,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033825600] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:32:03,924 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:32:03,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 43] total 53
[2025-05-07 17:32:03,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411117802]
[2025-05-07 17:32:03,924 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:32:03,924 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 53 states
[2025-05-07 17:32:03,924 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:32:03,925 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants.
[2025-05-07 17:32:03,925 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2493, Unknown=0, NotChecked=0, Total=2756
[2025-05-07 17:32:03,926 INFO  L87              Difference]: Start difference. First operand 126 states and 177 transitions. Second operand  has 53 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 52 states have internal predecessors, (66), 35 states have call successors, (57), 2 states have call predecessors, (57), 26 states have return successors, (78), 33 states have call predecessors, (78), 35 states have call successors, (78)
[2025-05-07 17:32:04,395 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:32:04,395 INFO  L93              Difference]: Finished difference Result 135 states and 199 transitions.
[2025-05-07 17:32:04,395 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2025-05-07 17:32:04,395 INFO  L79                 Accepts]: Start accepts. Automaton has  has 53 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 52 states have internal predecessors, (66), 35 states have call successors, (57), 2 states have call predecessors, (57), 26 states have return successors, (78), 33 states have call predecessors, (78), 35 states have call successors, (78) Word has length 539
[2025-05-07 17:32:04,396 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:32:04,397 INFO  L225             Difference]: With dead ends: 135
[2025-05-07 17:32:04,397 INFO  L226             Difference]: Without dead ends: 128
[2025-05-07 17:32:04,397 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 1134 GetRequests, 1056 SyntacticMatches, 13 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=465, Invalid=3957, Unknown=0, NotChecked=0, Total=4422
[2025-05-07 17:32:04,397 INFO  L437           NwaCegarLoop]: 44 mSDtfsCounter, 35 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:32:04,397 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1012 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:32:04,398 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 128 states.
[2025-05-07 17:32:04,401 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124.
[2025-05-07 17:32:04,401 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 124 states, 54 states have (on average 1.037037037037037) internal successors, (56), 53 states have internal predecessors, (56), 40 states have call successors, (40), 28 states have call predecessors, (40), 29 states have return successors, (75), 42 states have call predecessors, (75), 40 states have call successors, (75)
[2025-05-07 17:32:04,401 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions.
[2025-05-07 17:32:04,401 INFO  L79                 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 539
[2025-05-07 17:32:04,402 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:32:04,402 INFO  L485      AbstractCegarLoop]: Abstraction has 124 states and 171 transitions.
[2025-05-07 17:32:04,402 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 53 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 52 states have internal predecessors, (66), 35 states have call successors, (57), 2 states have call predecessors, (57), 26 states have return successors, (78), 33 states have call predecessors, (78), 35 states have call successors, (78)
[2025-05-07 17:32:04,402 INFO  L278                IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions.
[2025-05-07 17:32:04,406 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 1020
[2025-05-07 17:32:04,406 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:32:04,406 INFO  L218           NwaCegarLoop]: trace histogram [127, 64, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:32:04,423 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0
[2025-05-07 17:32:04,607 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2025-05-07 17:32:04,608 INFO  L403      AbstractCegarLoop]: === Iteration 27 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:32:04,608 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:32:04,609 INFO  L85        PathProgramCache]: Analyzing trace with hash -505493242, now seen corresponding path program 20 times
[2025-05-07 17:32:04,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:32:04,609 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271541028]
[2025-05-07 17:32:04,610 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:32:04,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:32:04,739 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1019 statements into 2 equivalence classes.
[2025-05-07 17:32:04,858 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1019 of 1019 statements.
[2025-05-07 17:32:04,859 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:32:04,859 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:33:56,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 41705 backedges. 3993 proven. 16751 refuted. 0 times theorem prover too weak. 20961 trivial. 0 not checked.
[2025-05-07 17:33:56,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:33:56,572 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271541028]
[2025-05-07 17:33:56,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271541028] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:33:56,572 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506099405]
[2025-05-07 17:33:56,572 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:33:56,572 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:33:56,574 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:33:56,575 INFO  L229       MonitoredProcess]: Starting monitored process 23 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:33:56,576 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process
[2025-05-07 17:34:00,183 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1019 statements into 2 equivalence classes.
[2025-05-07 17:34:00,728 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1019 of 1019 statements.
[2025-05-07 17:34:00,728 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:34:00,728 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:34:00,753 INFO  L256         TraceCheckSpWp]: Trace formula consists of 4941 conjuncts, 975 conjuncts are in the unsatisfiable core
[2025-05-07 17:34:00,770 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:34:00,781 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2025-05-07 17:34:03,038 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9
[2025-05-07 17:34:03,348 INFO  L134       CoverageAnalysis]: Checked inductivity of 41705 backedges. 3932 proven. 16782 refuted. 0 times theorem prover too weak. 20991 trivial. 0 not checked.
[2025-05-07 17:34:03,349 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:38:43,483 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:38:43,483 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:38:43,485 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:04,467 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:04,467 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:04,470 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:10,016 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:10,016 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:10,018 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:11,888 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:11,889 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:11,890 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:13,233 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:39:13,233 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:39:13,245 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:13,245 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:39:13,249 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:13,249 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:13,250 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:15,709 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:15,710 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:15,711 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:15,734 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:39:15,734 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:39:15,749 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:15,749 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:39:17,553 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:17,553 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:17,555 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:18,554 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:18,554 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:39:18,571 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:39:18,571 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:39:18,588 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:18,588 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:18,589 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:24,788 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:24,788 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:39:24,805 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:39:24,805 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:39:24,841 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:24,841 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:24,843 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:31,622 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:31,622 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:31,625 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:33,415 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:33,415 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:33,417 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:34,565 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:39:34,565 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:39:34,589 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:34,589 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:39:34,593 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:34,593 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:34,595 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:37,643 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:39:37,643 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:39:37,684 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:37,684 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:39:37,690 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:37,690 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:37,692 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:39,631 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:39,631 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:39,633 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:40,896 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:40,896 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:39:40,898 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:39:40,907 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:39:40,907 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:39:40,925 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:39:40,925 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:40:00,251 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:00,251 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:00,253 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:00,278 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:40:00,278 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:40:00,291 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:00,291 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:40:21,457 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:21,457 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:21,460 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:28,896 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:28,896 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:28,899 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:30,689 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:30,689 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:30,691 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:31,785 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:31,785 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:31,787 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:31,797 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:31,797 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:40:31,816 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:40:31,816 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:40:35,177 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:35,177 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:35,179 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:35,204 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:40:35,204 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:40:35,221 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:35,221 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:40:37,301 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:37,301 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:37,304 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:38,225 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:38,225 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:38,227 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:38,235 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:38,235 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:40:38,249 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:40:38,249 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:40:44,632 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:44,632 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:44,634 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:44,653 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:40:44,653 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:40:44,688 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:44,688 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:40:51,651 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:51,652 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:51,654 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:53,330 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:53,331 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:53,332 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:54,256 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:40:54,256 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:40:54,271 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:54,271 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:40:54,275 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:54,275 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:54,276 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:56,663 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:40:56,663 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:40:56,680 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:56,680 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:40:56,684 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:56,684 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:56,685 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:59,066 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:59,066 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:40:59,068 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:40:59,975 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:40:59,975 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 11 treesize of output 8
[2025-05-07 17:40:59,992 INFO  L325             Elim1Store]: treesize reduction 12, result has 70.0 percent of original size
[2025-05-07 17:40:59,992 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 49
[2025-05-07 17:41:00,008 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:41:00,008 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30
[2025-05-07 17:41:00,009 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18
[2025-05-07 17:41:00,785 INFO  L134       CoverageAnalysis]: Checked inductivity of 41705 backedges. 3932 proven. 17451 refuted. 0 times theorem prover too weak. 20322 trivial. 0 not checked.
[2025-05-07 17:41:00,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [506099405] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:41:00,785 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:41:00,785 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 59] total 92
[2025-05-07 17:41:00,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637604648]
[2025-05-07 17:41:00,786 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:41:00,786 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 92 states
[2025-05-07 17:41:00,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:41:00,787 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants.
[2025-05-07 17:41:00,788 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=7973, Unknown=0, NotChecked=0, Total=8372
[2025-05-07 17:41:00,788 INFO  L87              Difference]: Start difference. First operand 124 states and 171 transitions. Second operand  has 92 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 75 states have internal predecessors, (86), 50 states have call successors, (78), 2 states have call predecessors, (78), 45 states have return successors, (110), 66 states have call predecessors, (110), 50 states have call successors, (110)
[2025-05-07 17:41:04,363 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:41:04,363 INFO  L93              Difference]: Finished difference Result 174 states and 284 transitions.
[2025-05-07 17:41:04,363 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. 
[2025-05-07 17:41:04,363 INFO  L79                 Accepts]: Start accepts. Automaton has  has 92 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 75 states have internal predecessors, (86), 50 states have call successors, (78), 2 states have call predecessors, (78), 45 states have return successors, (110), 66 states have call predecessors, (110), 50 states have call successors, (110) Word has length 1019
[2025-05-07 17:41:04,364 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:41:04,365 INFO  L225             Difference]: With dead ends: 174
[2025-05-07 17:41:04,366 INFO  L226             Difference]: Without dead ends: 174
[2025-05-07 17:41:04,366 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2370 GetRequests, 2235 SyntacticMatches, 19 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4487 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=812, Invalid=12994, Unknown=0, NotChecked=0, Total=13806
[2025-05-07 17:41:04,367 INFO  L437           NwaCegarLoop]: 75 mSDtfsCounter, 81 mSDsluCounter, 3719 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 3794 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:41:04,367 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 3794 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-05-07 17:41:04,367 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 174 states.
[2025-05-07 17:41:04,373 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 139.
[2025-05-07 17:41:04,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 139 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 59 states have internal predecessors, (62), 43 states have call successors, (43), 28 states have call predecessors, (43), 35 states have return successors, (98), 51 states have call predecessors, (98), 43 states have call successors, (98)
[2025-05-07 17:41:04,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 203 transitions.
[2025-05-07 17:41:04,374 INFO  L79                 Accepts]: Start accepts. Automaton has 139 states and 203 transitions. Word has length 1019
[2025-05-07 17:41:04,375 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:41:04,375 INFO  L485      AbstractCegarLoop]: Abstraction has 139 states and 203 transitions.
[2025-05-07 17:41:04,375 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 92 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 75 states have internal predecessors, (86), 50 states have call successors, (78), 2 states have call predecessors, (78), 45 states have return successors, (110), 66 states have call predecessors, (110), 50 states have call successors, (110)
[2025-05-07 17:41:04,375 INFO  L278                IsEmpty]: Start isEmpty. Operand 139 states and 203 transitions.
[2025-05-07 17:41:04,382 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 1260
[2025-05-07 17:41:04,382 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:41:04,382 INFO  L218           NwaCegarLoop]: trace histogram [159, 80, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:41:04,406 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0
[2025-05-07 17:41:04,583 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2025-05-07 17:41:04,583 INFO  L403      AbstractCegarLoop]: === Iteration 28 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:41:04,584 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:41:04,585 INFO  L85        PathProgramCache]: Analyzing trace with hash -1313622250, now seen corresponding path program 21 times
[2025-05-07 17:41:04,586 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:41:04,586 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939154666]
[2025-05-07 17:41:04,586 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:41:04,586 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:41:04,778 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1259 statements into 98 equivalence classes.
[2025-05-07 17:41:05,672 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 86 check-sat command(s) and asserted 1123 of 1259 statements.
[2025-05-07 17:41:05,672 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 86 check-sat command(s)
[2025-05-07 17:41:05,672 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:41:19,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 65537 backedges. 3156 proven. 2606 refuted. 0 times theorem prover too weak. 59775 trivial. 0 not checked.
[2025-05-07 17:41:19,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:41:19,466 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939154666]
[2025-05-07 17:41:19,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939154666] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:41:19,466 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300248459]
[2025-05-07 17:41:19,466 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:41:19,466 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:41:19,467 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:41:19,469 INFO  L229       MonitoredProcess]: Starting monitored process 24 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:41:19,470 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process
[2025-05-07 17:41:24,580 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1259 statements into 98 equivalence classes.
[2025-05-07 17:41:26,037 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 86 check-sat command(s) and asserted 1123 of 1259 statements.
[2025-05-07 17:41:26,037 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 86 check-sat command(s)
[2025-05-07 17:41:26,037 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:41:26,059 INFO  L256         TraceCheckSpWp]: Trace formula consists of 5429 conjuncts, 67 conjuncts are in the unsatisfiable core
[2025-05-07 17:41:26,069 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:41:26,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 65537 backedges. 3089 proven. 2786 refuted. 0 times theorem prover too weak. 59662 trivial. 0 not checked.
[2025-05-07 17:41:26,633 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:41:58,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 65537 backedges. 3124 proven. 2806 refuted. 0 times theorem prover too weak. 59607 trivial. 0 not checked.
[2025-05-07 17:41:58,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [300248459] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:41:58,095 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:41:58,095 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 37, 52] total 83
[2025-05-07 17:41:58,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535938634]
[2025-05-07 17:41:58,095 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:41:58,096 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 83 states
[2025-05-07 17:41:58,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:41:58,097 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants.
[2025-05-07 17:41:58,097 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=6333, Unknown=0, NotChecked=0, Total=6806
[2025-05-07 17:41:58,097 INFO  L87              Difference]: Start difference. First operand 139 states and 203 transitions. Second operand  has 83 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 77 states have internal predecessors, (92), 44 states have call successors, (83), 2 states have call predecessors, (83), 45 states have return successors, (114), 65 states have call predecessors, (114), 44 states have call successors, (114)
[2025-05-07 17:41:59,902 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:41:59,902 INFO  L93              Difference]: Finished difference Result 183 states and 326 transitions.
[2025-05-07 17:41:59,903 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. 
[2025-05-07 17:41:59,903 INFO  L79                 Accepts]: Start accepts. Automaton has  has 83 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 77 states have internal predecessors, (92), 44 states have call successors, (83), 2 states have call predecessors, (83), 45 states have return successors, (114), 65 states have call predecessors, (114), 44 states have call successors, (114) Word has length 1259
[2025-05-07 17:41:59,904 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:41:59,905 INFO  L225             Difference]: With dead ends: 183
[2025-05-07 17:41:59,905 INFO  L226             Difference]: Without dead ends: 183
[2025-05-07 17:41:59,906 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2599 GetRequests, 2475 SyntacticMatches, 14 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3868 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1033, Invalid=11399, Unknown=0, NotChecked=0, Total=12432
[2025-05-07 17:41:59,906 INFO  L437           NwaCegarLoop]: 87 mSDtfsCounter, 77 mSDsluCounter, 2598 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 3031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:41:59,907 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 2685 Invalid, 3031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2875 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-05-07 17:41:59,907 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2025-05-07 17:41:59,912 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 140.
[2025-05-07 17:41:59,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 140 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 59 states have internal predecessors, (62), 46 states have call successors, (46), 30 states have call predecessors, (46), 33 states have return successors, (98), 50 states have call predecessors, (98), 46 states have call successors, (98)
[2025-05-07 17:41:59,912 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions.
[2025-05-07 17:41:59,912 INFO  L79                 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 1259
[2025-05-07 17:41:59,913 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:41:59,913 INFO  L485      AbstractCegarLoop]: Abstraction has 140 states and 206 transitions.
[2025-05-07 17:41:59,913 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 83 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 77 states have internal predecessors, (92), 44 states have call successors, (83), 2 states have call predecessors, (83), 45 states have return successors, (114), 65 states have call predecessors, (114), 44 states have call successors, (114)
[2025-05-07 17:41:59,913 INFO  L278                IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions.
[2025-05-07 17:41:59,920 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 1271
[2025-05-07 17:41:59,920 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:41:59,920 INFO  L218           NwaCegarLoop]: trace histogram [159, 80, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:41:59,961 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0
[2025-05-07 17:42:00,120 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:42:00,121 INFO  L403      AbstractCegarLoop]: === Iteration 29 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:42:00,121 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:42:00,121 INFO  L85        PathProgramCache]: Analyzing trace with hash -814816887, now seen corresponding path program 22 times
[2025-05-07 17:42:00,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:42:00,121 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688726734]
[2025-05-07 17:42:00,122 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:42:00,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:42:00,287 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1270 statements into 2 equivalence classes.
[2025-05-07 17:42:00,362 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1269 of 1270 statements.
[2025-05-07 17:42:00,363 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-05-07 17:42:00,363 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:42:12,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 65595 backedges. 4202 proven. 5354 refuted. 0 times theorem prover too weak. 56039 trivial. 0 not checked.
[2025-05-07 17:42:12,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:42:12,269 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688726734]
[2025-05-07 17:42:12,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688726734] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:42:12,269 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713852284]
[2025-05-07 17:42:12,270 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:42:12,270 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:42:12,272 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:42:12,273 INFO  L229       MonitoredProcess]: Starting monitored process 25 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:42:12,274 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process
[2025-05-07 17:42:18,258 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1270 statements into 2 equivalence classes.
[2025-05-07 17:42:18,690 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1269 of 1270 statements.
[2025-05-07 17:42:18,690 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-05-07 17:42:18,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:42:18,710 INFO  L256         TraceCheckSpWp]: Trace formula consists of 6141 conjuncts, 65 conjuncts are in the unsatisfiable core
[2025-05-07 17:42:18,720 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:42:18,968 INFO  L134       CoverageAnalysis]: Checked inductivity of 65595 backedges. 4200 proven. 5335 refuted. 0 times theorem prover too weak. 56060 trivial. 0 not checked.
[2025-05-07 17:42:18,968 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:42:47,587 INFO  L134       CoverageAnalysis]: Checked inductivity of 65595 backedges. 4213 proven. 5400 refuted. 0 times theorem prover too weak. 55982 trivial. 0 not checked.
[2025-05-07 17:42:47,587 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [713852284] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:42:47,587 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:42:47,587 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 49] total 59
[2025-05-07 17:42:47,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735347467]
[2025-05-07 17:42:47,587 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:42:47,588 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 59 states
[2025-05-07 17:42:47,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:42:47,589 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants.
[2025-05-07 17:42:47,589 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=3057, Unknown=0, NotChecked=0, Total=3422
[2025-05-07 17:42:47,589 INFO  L87              Difference]: Start difference. First operand 140 states and 206 transitions. Second operand  has 59 states, 27 states have (on average 3.0) internal successors, (81), 55 states have internal predecessors, (81), 46 states have call successors, (76), 2 states have call predecessors, (76), 27 states have return successors, (103), 30 states have call predecessors, (103), 46 states have call successors, (103)
[2025-05-07 17:42:48,551 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:42:48,552 INFO  L93              Difference]: Finished difference Result 164 states and 241 transitions.
[2025-05-07 17:42:48,552 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2025-05-07 17:42:48,552 INFO  L79                 Accepts]: Start accepts. Automaton has  has 59 states, 27 states have (on average 3.0) internal successors, (81), 55 states have internal predecessors, (81), 46 states have call successors, (76), 2 states have call predecessors, (76), 27 states have return successors, (103), 30 states have call predecessors, (103), 46 states have call successors, (103) Word has length 1270
[2025-05-07 17:42:48,553 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:42:48,554 INFO  L225             Difference]: With dead ends: 164
[2025-05-07 17:42:48,554 INFO  L226             Difference]: Without dead ends: 164
[2025-05-07 17:42:48,554 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2613 GetRequests, 2518 SyntacticMatches, 14 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2389 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=966, Invalid=5840, Unknown=0, NotChecked=0, Total=6806
[2025-05-07 17:42:48,555 INFO  L437           NwaCegarLoop]: 73 mSDtfsCounter, 126 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:42:48,555 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1480 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-05-07 17:42:48,555 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2025-05-07 17:42:48,559 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160.
[2025-05-07 17:42:48,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 160 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 69 states have internal predecessors, (72), 56 states have call successors, (56), 40 states have call predecessors, (56), 33 states have return successors, (104), 50 states have call predecessors, (104), 56 states have call successors, (104)
[2025-05-07 17:42:48,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions.
[2025-05-07 17:42:48,560 INFO  L79                 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 1270
[2025-05-07 17:42:48,561 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:42:48,561 INFO  L485      AbstractCegarLoop]: Abstraction has 160 states and 232 transitions.
[2025-05-07 17:42:48,561 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 59 states, 27 states have (on average 3.0) internal successors, (81), 55 states have internal predecessors, (81), 46 states have call successors, (76), 2 states have call predecessors, (76), 27 states have return successors, (103), 30 states have call predecessors, (103), 46 states have call successors, (103)
[2025-05-07 17:42:48,561 INFO  L278                IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions.
[2025-05-07 17:42:48,566 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 1031
[2025-05-07 17:42:48,566 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:42:48,566 INFO  L218           NwaCegarLoop]: trace histogram [127, 64, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:42:48,612 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0
[2025-05-07 17:42:48,766 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:42:48,766 INFO  L403      AbstractCegarLoop]: === Iteration 30 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:42:48,767 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:42:48,767 INFO  L85        PathProgramCache]: Analyzing trace with hash 2017757081, now seen corresponding path program 23 times
[2025-05-07 17:42:48,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:42:48,767 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464455904]
[2025-05-07 17:42:48,767 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-05-07 17:42:48,767 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:42:48,922 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1030 statements into 80 equivalence classes.
[2025-05-07 17:42:49,883 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s) and asserted 1030 of 1030 statements.
[2025-05-07 17:42:49,883 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s)
[2025-05-07 17:42:49,883 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:43:08,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 41763 backedges. 2373 proven. 7009 refuted. 0 times theorem prover too weak. 32381 trivial. 0 not checked.
[2025-05-07 17:43:08,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:43:08,603 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464455904]
[2025-05-07 17:43:08,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464455904] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:43:08,603 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028685341]
[2025-05-07 17:43:08,604 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-05-07 17:43:08,604 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:43:08,609 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:43:08,611 INFO  L229       MonitoredProcess]: Starting monitored process 26 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:43:08,612 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process
[2025-05-07 17:43:13,636 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1030 statements into 80 equivalence classes.
[2025-05-07 17:43:14,860 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s) and asserted 1030 of 1030 statements.
[2025-05-07 17:43:14,860 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s)
[2025-05-07 17:43:14,861 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:43:14,880 INFO  L256         TraceCheckSpWp]: Trace formula consists of 4995 conjuncts, 67 conjuncts are in the unsatisfiable core
[2025-05-07 17:43:14,896 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:43:15,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 41763 backedges. 2466 proven. 1412 refuted. 0 times theorem prover too weak. 37885 trivial. 0 not checked.
[2025-05-07 17:43:15,518 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:43:43,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 41763 backedges. 2496 proven. 1428 refuted. 0 times theorem prover too weak. 37839 trivial. 0 not checked.
[2025-05-07 17:43:43,414 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028685341] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:43:43,415 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:43:43,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 36, 51] total 89
[2025-05-07 17:43:43,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673328388]
[2025-05-07 17:43:43,416 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:43:43,418 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 89 states
[2025-05-07 17:43:43,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:43:43,419 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants.
[2025-05-07 17:43:43,420 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=7253, Unknown=0, NotChecked=0, Total=7832
[2025-05-07 17:43:43,421 INFO  L87              Difference]: Start difference. First operand 160 states and 232 transitions. Second operand  has 89 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 82 states have internal predecessors, (97), 49 states have call successors, (86), 2 states have call predecessors, (86), 52 states have return successors, (131), 68 states have call predecessors, (131), 49 states have call successors, (131)
[2025-05-07 17:43:44,635 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:43:44,635 INFO  L93              Difference]: Finished difference Result 186 states and 279 transitions.
[2025-05-07 17:43:44,635 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2025-05-07 17:43:44,635 INFO  L79                 Accepts]: Start accepts. Automaton has  has 89 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 82 states have internal predecessors, (97), 49 states have call successors, (86), 2 states have call predecessors, (86), 52 states have return successors, (131), 68 states have call predecessors, (131), 49 states have call successors, (131) Word has length 1030
[2025-05-07 17:43:44,637 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:43:44,638 INFO  L225             Difference]: With dead ends: 186
[2025-05-07 17:43:44,638 INFO  L226             Difference]: Without dead ends: 179
[2025-05-07 17:43:44,639 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2171 GetRequests, 2053 SyntacticMatches, 13 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=880, Invalid=10462, Unknown=0, NotChecked=0, Total=11342
[2025-05-07 17:43:44,640 INFO  L437           NwaCegarLoop]: 74 mSDtfsCounter, 98 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:43:44,640 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 2610 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-05-07 17:43:44,640 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 179 states.
[2025-05-07 17:43:44,647 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 162.
[2025-05-07 17:43:44,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 162 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 71 states have internal predecessors, (74), 56 states have call successors, (56), 42 states have call predecessors, (56), 33 states have return successors, (103), 48 states have call predecessors, (103), 56 states have call successors, (103)
[2025-05-07 17:43:44,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 233 transitions.
[2025-05-07 17:43:44,649 INFO  L79                 Accepts]: Start accepts. Automaton has 162 states and 233 transitions. Word has length 1030
[2025-05-07 17:43:44,650 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:43:44,650 INFO  L485      AbstractCegarLoop]: Abstraction has 162 states and 233 transitions.
[2025-05-07 17:43:44,650 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 89 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 82 states have internal predecessors, (97), 49 states have call successors, (86), 2 states have call predecessors, (86), 52 states have return successors, (131), 68 states have call predecessors, (131), 49 states have call successors, (131)
[2025-05-07 17:43:44,650 INFO  L278                IsEmpty]: Start isEmpty. Operand 162 states and 233 transitions.
[2025-05-07 17:43:44,671 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 1991
[2025-05-07 17:43:44,671 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:43:44,672 INFO  L218           NwaCegarLoop]: trace histogram [255, 128, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:43:44,715 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0
[2025-05-07 17:43:44,872 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,26 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:43:44,873 INFO  L403      AbstractCegarLoop]: === Iteration 31 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:43:44,874 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:43:44,875 INFO  L85        PathProgramCache]: Analyzing trace with hash 1653237593, now seen corresponding path program 24 times
[2025-05-07 17:43:44,875 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:43:44,875 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632884424]
[2025-05-07 17:43:44,876 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-05-07 17:43:44,876 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:43:45,146 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1990 statements into 167 equivalence classes.
[2025-05-07 17:43:50,708 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 166 check-sat command(s) and asserted 1979 of 1990 statements.
[2025-05-07 17:43:50,708 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 166 check-sat command(s)
[2025-05-07 17:43:50,708 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
