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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:35,697 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:35,806 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c41cec6-0a84-44c5-a7c3-61aad0771631/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:35,811 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:35,812 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:35,846 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:35,847 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:35,847 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:35,847 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:35,848 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:35,849 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:35,850 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:35,850 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:35,850 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:35,851 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:35,851 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:35,852 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:35,852 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:35,852 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:35,852 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:35,852 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:35,852 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:35,852 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:35,852 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:35,852 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:35,853 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:35,854 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:36,196 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:36,211 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:36,213 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:36,215 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:36,215 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:36,217 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c41cec6-0a84-44c5-a7c3-61aad0771631/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-098.smt2
[2025-04-28 21:21:36,221 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:36,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:36,437 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c41cec6-0a84-44c5-a7c3-61aad0771631/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-098.smt2
[2025-04-28 21:21:36,440 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:36,445 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:36,449 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:36,449 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:36,450 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:36,453 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:36" (1/1) ...
[2025-04-28 21:21:36,478 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:36 Unit
[2025-04-28 21:21:36,478 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:36,480 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:36,481 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:36,481 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:36,498 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:36" (1/1) ...
[2025-04-28 21:21:36,499 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:36" (1/1) ...
[2025-04-28 21:21:36,527 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:36" (1/1) ...
[2025-04-28 21:21:36,528 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:36" (1/1) ...
[2025-04-28 21:21:36,530 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:36" (1/1) ...
[2025-04-28 21:21:36,531 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:36" (1/1) ...
[2025-04-28 21:21:36,533 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:36" (1/1) ...
[2025-04-28 21:21:36,534 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:36" (1/1) ...
[2025-04-28 21:21:36,535 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:36" (1/1) ...
[2025-04-28 21:21:36,552 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:36,554 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:36,555 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:36,555 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:36,556 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:36" (1/1) ...
[2025-04-28 21:21:36,559 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:36,575 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:36,592 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:36,596 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:36,608 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:36,609 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:36,609 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:36,609 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure itp2 given in one single declaration
[2025-04-28 21:21:36,609 INFO  L130     BoogieDeclarations]: Found specification of procedure itp2
[2025-04-28 21:21:36,609 INFO  L138     BoogieDeclarations]: Found implementation of procedure itp2
[2025-04-28 21:21:36,609 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure itp1 given in one single declaration
[2025-04-28 21:21:36,609 INFO  L130     BoogieDeclarations]: Found specification of procedure itp1
[2025-04-28 21:21:36,610 INFO  L138     BoogieDeclarations]: Found implementation of procedure itp1
[2025-04-28 21:21:36,610 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:36,610 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:36,610 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:36,653 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:36,657 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:36,732 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:36,733 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:36,752 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:36,752 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:36,753 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:36 BoogieIcfgContainer
[2025-04-28 21:21:36,753 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:36,758 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:36,758 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:36,763 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:36,763 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:36" (1/3) ...
[2025-04-28 21:21:36,764 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1154ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:36, skipping insertion in model container
[2025-04-28 21:21:36,765 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:36" (2/3) ...
[2025-04-28 21:21:36,765 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1154ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:36, skipping insertion in model container
[2025-04-28 21:21:36,765 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:36" (3/3) ...
[2025-04-28 21:21:36,767 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:36,787 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:36,792 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 4 procedures, 18 locations, 26 edges, 4 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:36,847 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:36,874 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;@5ea51b1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:36,874 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:36,878 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 18 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2025-04-28 21:21:36,886 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-04-28 21:21:36,887 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,887 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:36,888 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,893 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,894 INFO  L85        PathProgramCache]: Analyzing trace with hash -880054556, now seen corresponding path program 1 times
[2025-04-28 21:21:36,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,903 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193030921]
[2025-04-28 21:21:36,903 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,935 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-04-28 21:21:36,967 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-04-28 21:21:36,968 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,968 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:37,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,291 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193030921]
[2025-04-28 21:21:37,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193030921] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:37,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:37,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:37,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135904102]
[2025-04-28 21:21:37,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,306 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:37,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,339 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:37,340 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:37,342 INFO  L87              Difference]: Start difference. First operand  has 18 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand  has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-04-28 21:21:37,495 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,497 INFO  L93              Difference]: Finished difference Result 22 states and 27 transitions.
[2025-04-28 21:21:37,499 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:37,501 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 13
[2025-04-28 21:21:37,501 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,514 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:21:37,514 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:21:37,516 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:37,524 INFO  L437           NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,525 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 61 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:37,565 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:21:37,586 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20.
[2025-04-28 21:21:37,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8)
[2025-04-28 21:21:37,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions.
[2025-04-28 21:21:37,625 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13
[2025-04-28 21:21:37,625 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:37,626 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 24 transitions.
[2025-04-28 21:21:37,626 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-04-28 21:21:37,626 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions.
[2025-04-28 21:21:37,627 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:37,627 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:37,627 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:37,628 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:37,628 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:37,629 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:37,629 INFO  L85        PathProgramCache]: Analyzing trace with hash 228255401, now seen corresponding path program 1 times
[2025-04-28 21:21:37,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:37,629 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474821424]
[2025-04-28 21:21:37,629 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,636 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:37,644 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:37,644 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,644 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:37,971 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,971 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474821424]
[2025-04-28 21:21:37,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474821424] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:37,971 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080676724]
[2025-04-28 21:21:37,971 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,971 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,977 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:37,981 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:37,984 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:38,031 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:38,047 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:38,047 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,047 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,050 INFO  L256         TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:38,057 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:38,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:38,328 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:39,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:39,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080676724] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:39,380 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:39,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16
[2025-04-28 21:21:39,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126438753]
[2025-04-28 21:21:39,381 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,382 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-04-28 21:21:39,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,383 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-04-28 21:21:39,383 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:39,383 INFO  L87              Difference]: Start difference. First operand 20 states and 24 transitions. Second operand  has 16 states, 8 states have (on average 2.25) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 5 states have call predecessors, (10), 9 states have call successors, (10)
[2025-04-28 21:21:39,609 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,609 INFO  L93              Difference]: Finished difference Result 26 states and 31 transitions.
[2025-04-28 21:21:39,610 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:39,610 INFO  L79                 Accepts]: Start accepts. Automaton has  has 16 states, 8 states have (on average 2.25) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 5 states have call predecessors, (10), 9 states have call successors, (10) Word has length 17
[2025-04-28 21:21:39,611 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,612 INFO  L225             Difference]: With dead ends: 26
[2025-04-28 21:21:39,612 INFO  L226             Difference]: Without dead ends: 26
[2025-04-28 21:21:39,613 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:39,615 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,617 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 133 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:39,618 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2025-04-28 21:21:39,627 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24.
[2025-04-28 21:21:39,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10)
[2025-04-28 21:21:39,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions.
[2025-04-28 21:21:39,630 INFO  L79                 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17
[2025-04-28 21:21:39,631 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,631 INFO  L485      AbstractCegarLoop]: Abstraction has 24 states and 28 transitions.
[2025-04-28 21:21:39,631 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 8 states have (on average 2.25) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 5 states have call predecessors, (10), 9 states have call successors, (10)
[2025-04-28 21:21:39,631 INFO  L278                IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions.
[2025-04-28 21:21:39,632 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:39,633 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,633 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,639 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:39,837 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:39,837 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,837 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,838 INFO  L85        PathProgramCache]: Analyzing trace with hash 1653308232, now seen corresponding path program 1 times
[2025-04-28 21:21:39,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,838 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412058846]
[2025-04-28 21:21:39,838 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,847 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:39,857 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:39,857 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,857 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:40,049 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,049 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412058846]
[2025-04-28 21:21:40,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412058846] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:40,049 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:40,049 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:40,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894933219]
[2025-04-28 21:21:40,049 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,050 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:40,050 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,050 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:40,051 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:40,051 INFO  L87              Difference]: Start difference. First operand 24 states and 28 transitions. Second operand  has 7 states, 4 states have (on average 2.25) internal successors, (9), 7 states have internal predecessors, (9), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)
[2025-04-28 21:21:40,124 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,126 INFO  L93              Difference]: Finished difference Result 27 states and 32 transitions.
[2025-04-28 21:21:40,127 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:40,127 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 4 states have (on average 2.25) internal successors, (9), 7 states have internal predecessors, (9), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17
[2025-04-28 21:21:40,127 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,128 INFO  L225             Difference]: With dead ends: 27
[2025-04-28 21:21:40,128 INFO  L226             Difference]: Without dead ends: 27
[2025-04-28 21:21:40,128 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:40,129 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,129 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 66 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:40,130 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2025-04-28 21:21:40,136 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24.
[2025-04-28 21:21:40,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10)
[2025-04-28 21:21:40,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions.
[2025-04-28 21:21:40,139 INFO  L79                 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17
[2025-04-28 21:21:40,140 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,140 INFO  L485      AbstractCegarLoop]: Abstraction has 24 states and 28 transitions.
[2025-04-28 21:21:40,140 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 4 states have (on average 2.25) internal successors, (9), 7 states have internal predecessors, (9), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)
[2025-04-28 21:21:40,141 INFO  L278                IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions.
[2025-04-28 21:21:40,143 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:40,143 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,143 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,143 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:40,143 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,144 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,145 INFO  L85        PathProgramCache]: Analyzing trace with hash 1892120717, now seen corresponding path program 1 times
[2025-04-28 21:21:40,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,146 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429166390]
[2025-04-28 21:21:40,146 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,146 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,151 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:40,156 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:40,158 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,158 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:40,358 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,358 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429166390]
[2025-04-28 21:21:40,358 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429166390] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:40,359 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544786744]
[2025-04-28 21:21:40,359 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,359 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:40,361 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:40,364 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:40,366 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:40,411 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:40,429 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:40,429 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,429 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,430 INFO  L256         TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:40,432 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:40,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:40,505 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:41,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:41,288 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [544786744] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:41,288 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:41,288 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13
[2025-04-28 21:21:41,288 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914000315]
[2025-04-28 21:21:41,288 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:41,288 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:41,289 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:41,289 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:41,292 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:41,292 INFO  L87              Difference]: Start difference. First operand 24 states and 28 transitions. Second operand  has 13 states, 5 states have (on average 3.2) internal successors, (16), 13 states have internal predecessors, (16), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 10 states have call successors, (10)
[2025-04-28 21:21:41,403 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:41,403 INFO  L93              Difference]: Finished difference Result 28 states and 32 transitions.
[2025-04-28 21:21:41,404 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:41,404 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 5 states have (on average 3.2) internal successors, (16), 13 states have internal predecessors, (16), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 10 states have call successors, (10) Word has length 21
[2025-04-28 21:21:41,404 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:41,406 INFO  L225             Difference]: With dead ends: 28
[2025-04-28 21:21:41,406 INFO  L226             Difference]: Without dead ends: 28
[2025-04-28 21:21:41,406 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:41,407 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:41,407 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 99 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:41,410 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2025-04-28 21:21:41,413 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24.
[2025-04-28 21:21:41,415 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10)
[2025-04-28 21:21:41,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions.
[2025-04-28 21:21:41,416 INFO  L79                 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 21
[2025-04-28 21:21:41,416 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:41,416 INFO  L485      AbstractCegarLoop]: Abstraction has 24 states and 28 transitions.
[2025-04-28 21:21:41,416 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 5 states have (on average 3.2) internal successors, (16), 13 states have internal predecessors, (16), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 10 states have call successors, (10)
[2025-04-28 21:21:41,416 INFO  L278                IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions.
[2025-04-28 21:21:41,417 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:41,417 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:41,417 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:41,421 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:41,617 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:41,618 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:41,618 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:41,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 2114247155, now seen corresponding path program 2 times
[2025-04-28 21:21:41,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:41,618 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406037432]
[2025-04-28 21:21:41,618 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:41,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:41,624 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:41,626 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 25 statements.
[2025-04-28 21:21:41,626 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-04-28 21:21:41,626 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,652 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-04-28 21:21:41,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:41,652 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406037432]
[2025-04-28 21:21:41,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406037432] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:41,652 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:41,652 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:41,652 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421025026]
[2025-04-28 21:21:41,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:41,653 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:41,653 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:41,653 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:41,653 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:41,654 INFO  L87              Difference]: Start difference. First operand 24 states and 28 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:41,676 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:41,676 INFO  L93              Difference]: Finished difference Result 22 states and 25 transitions.
[2025-04-28 21:21:41,677 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:41,677 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25
[2025-04-28 21:21:41,677 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:41,677 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:21:41,678 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:21:41,678 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:41,679 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:41,679 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:41,680 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:21:41,682 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2025-04-28 21:21:41,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22 states, 10 states have (on average 1.2) internal successors, (12), 12 states have internal predecessors, (12), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8)
[2025-04-28 21:21:41,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions.
[2025-04-28 21:21:41,683 INFO  L79                 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 25
[2025-04-28 21:21:41,683 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:41,683 INFO  L485      AbstractCegarLoop]: Abstraction has 22 states and 25 transitions.
[2025-04-28 21:21:41,683 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:41,683 INFO  L278                IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions.
[2025-04-28 21:21:41,684 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:41,684 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:41,684 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:41,684 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:21:41,684 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:41,685 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:41,685 INFO  L85        PathProgramCache]: Analyzing trace with hash 155977490, now seen corresponding path program 2 times
[2025-04-28 21:21:41,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:41,685 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799246349]
[2025-04-28 21:21:41,685 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:41,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:41,689 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:41,694 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:41,694 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:41,694 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:41,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:41,861 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799246349]
[2025-04-28 21:21:41,862 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799246349] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:41,862 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582195269]
[2025-04-28 21:21:41,862 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:41,862 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:41,864 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:41,867 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:41,870 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:41,901 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:41,910 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:41,911 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:41,911 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,911 INFO  L256         TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:41,913 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:41,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:41,967 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:43,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:43,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582195269] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:43,210 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:43,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 14
[2025-04-28 21:21:43,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871946293]
[2025-04-28 21:21:43,210 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:43,211 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-04-28 21:21:43,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:43,211 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-04-28 21:21:43,212 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:43,212 INFO  L87              Difference]: Start difference. First operand 22 states and 25 transitions. Second operand  has 14 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 14 states have internal predecessors, (17), 10 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 5 states have call predecessors, (11), 10 states have call successors, (11)
[2025-04-28 21:21:43,314 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:43,314 INFO  L93              Difference]: Finished difference Result 24 states and 27 transitions.
[2025-04-28 21:21:43,316 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:43,316 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 14 states have internal predecessors, (17), 10 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 5 states have call predecessors, (11), 10 states have call successors, (11) Word has length 25
[2025-04-28 21:21:43,316 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:43,317 INFO  L225             Difference]: With dead ends: 24
[2025-04-28 21:21:43,317 INFO  L226             Difference]: Without dead ends: 24
[2025-04-28 21:21:43,317 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:43,318 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:43,318 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:43,319 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2025-04-28 21:21:43,328 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2025-04-28 21:21:43,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9)
[2025-04-28 21:21:43,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions.
[2025-04-28 21:21:43,329 INFO  L79                 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 25
[2025-04-28 21:21:43,329 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:43,329 INFO  L485      AbstractCegarLoop]: Abstraction has 24 states and 27 transitions.
[2025-04-28 21:21:43,329 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 14 states have internal predecessors, (17), 10 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 5 states have call predecessors, (11), 10 states have call successors, (11)
[2025-04-28 21:21:43,329 INFO  L278                IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions.
[2025-04-28 21:21:43,330 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:43,330 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:43,330 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:43,338 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:43,531 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:43,531 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:43,531 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:43,531 INFO  L85        PathProgramCache]: Analyzing trace with hash 556701399, now seen corresponding path program 3 times
[2025-04-28 21:21:43,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:43,532 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459708126]
[2025-04-28 21:21:43,532 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:43,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:43,537 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes.
[2025-04-28 21:21:43,540 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 29 statements.
[2025-04-28 21:21:43,540 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2025-04-28 21:21:43,540 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:43,597 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-04-28 21:21:43,597 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:43,597 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459708126]
[2025-04-28 21:21:43,597 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459708126] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:43,597 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968444530]
[2025-04-28 21:21:43,597 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:43,597 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:43,600 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:43,602 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:43,606 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:43,654 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes.
[2025-04-28 21:21:43,664 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 29 statements.
[2025-04-28 21:21:43,664 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2025-04-28 21:21:43,664 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:43,665 INFO  L256         TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:43,666 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:43,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-04-28 21:21:43,719 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:44,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-04-28 21:21:44,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [968444530] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:44,345 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:44,345 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10
[2025-04-28 21:21:44,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391767162]
[2025-04-28 21:21:44,346 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:44,346 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:44,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:44,347 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:44,347 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:44,347 INFO  L87              Difference]: Start difference. First operand 24 states and 27 transitions. Second operand  has 10 states, 6 states have (on average 2.5) internal successors, (15), 10 states have internal predecessors, (15), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9)
[2025-04-28 21:21:44,405 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:44,405 INFO  L93              Difference]: Finished difference Result 26 states and 29 transitions.
[2025-04-28 21:21:44,406 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:44,406 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 6 states have (on average 2.5) internal successors, (15), 10 states have internal predecessors, (15), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) Word has length 29
[2025-04-28 21:21:44,406 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:44,407 INFO  L225             Difference]: With dead ends: 26
[2025-04-28 21:21:44,407 INFO  L226             Difference]: Without dead ends: 26
[2025-04-28 21:21:44,407 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:44,408 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:44,408 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:44,409 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2025-04-28 21:21:44,414 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2025-04-28 21:21:44,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 8 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10)
[2025-04-28 21:21:44,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions.
[2025-04-28 21:21:44,415 INFO  L79                 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 29
[2025-04-28 21:21:44,415 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:44,415 INFO  L485      AbstractCegarLoop]: Abstraction has 26 states and 29 transitions.
[2025-04-28 21:21:44,415 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 6 states have (on average 2.5) internal successors, (15), 10 states have internal predecessors, (15), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9)
[2025-04-28 21:21:44,415 INFO  L278                IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2025-04-28 21:21:44,416 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:44,416 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:44,416 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:44,420 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:44,617 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,618 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:44,618 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:44,618 INFO  L85        PathProgramCache]: Analyzing trace with hash -981740613, now seen corresponding path program 4 times
[2025-04-28 21:21:44,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:44,618 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077186458]
[2025-04-28 21:21:44,618 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:44,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:44,626 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes.
[2025-04-28 21:21:44,640 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:44,640 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-04-28 21:21:44,640 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2025-04-28 21:21:44,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:44,771 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077186458]
[2025-04-28 21:21:44,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077186458] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:44,771 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209220799]
[2025-04-28 21:21:44,771 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:44,771 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,774 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:44,776 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:44,783 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:44,836 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes.
[2025-04-28 21:21:44,854 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:44,855 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-04-28 21:21:44,855 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,856 INFO  L256         TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:44,858 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:45,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-04-28 21:21:45,098 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:49,099 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-04-28 21:21:49,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209220799] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:49,099 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:49,099 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 16] total 24
[2025-04-28 21:21:49,100 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552358859]
[2025-04-28 21:21:49,100 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:49,100 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-04-28 21:21:49,100 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:49,101 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-04-28 21:21:49,101 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:21:49,102 INFO  L87              Difference]: Start difference. First operand 26 states and 29 transitions. Second operand  has 24 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 24 states have internal predecessors, (29), 13 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (20), 9 states have call predecessors, (20), 13 states have call successors, (20)
[2025-04-28 21:21:49,309 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:49,309 INFO  L93              Difference]: Finished difference Result 28 states and 31 transitions.
[2025-04-28 21:21:49,310 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:49,310 INFO  L79                 Accepts]: Start accepts. Automaton has  has 24 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 24 states have internal predecessors, (29), 13 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (20), 9 states have call predecessors, (20), 13 states have call successors, (20) Word has length 33
[2025-04-28 21:21:49,310 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:49,311 INFO  L225             Difference]: With dead ends: 28
[2025-04-28 21:21:49,311 INFO  L226             Difference]: Without dead ends: 28
[2025-04-28 21:21:49,311 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:21:49,312 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:49,312 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 175 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:49,312 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2025-04-28 21:21:49,315 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2025-04-28 21:21:49,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 9 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11)
[2025-04-28 21:21:49,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions.
[2025-04-28 21:21:49,316 INFO  L79                 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 33
[2025-04-28 21:21:49,316 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:49,316 INFO  L485      AbstractCegarLoop]: Abstraction has 28 states and 31 transitions.
[2025-04-28 21:21:49,316 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 24 states have internal predecessors, (29), 13 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (20), 9 states have call predecessors, (20), 13 states have call successors, (20)
[2025-04-28 21:21:49,316 INFO  L278                IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions.
[2025-04-28 21:21:49,317 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-04-28 21:21:49,317 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:49,317 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:49,321 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:49,518 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:49,519 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:49,519 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:49,519 INFO  L85        PathProgramCache]: Analyzing trace with hash -1974464353, now seen corresponding path program 5 times
[2025-04-28 21:21:49,519 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:49,519 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62266044]
[2025-04-28 21:21:49,519 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:49,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:49,524 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes.
[2025-04-28 21:21:49,530 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:49,530 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s)
[2025-04-28 21:21:49,530 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2025-04-28 21:21:49,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:49,642 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62266044]
[2025-04-28 21:21:49,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62266044] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:49,642 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097970807]
[2025-04-28 21:21:49,642 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:49,642 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:49,645 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:49,647 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:49,651 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:49,737 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes.
[2025-04-28 21:21:49,753 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:49,753 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s)
[2025-04-28 21:21:49,753 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,754 INFO  L256         TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 26 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:49,756 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:49,981 INFO  L134       CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:21:49,981 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:55,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:55,382 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097970807] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:55,382 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:55,382 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 18] total 27
[2025-04-28 21:21:55,382 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396272608]
[2025-04-28 21:21:55,382 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:55,382 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2025-04-28 21:21:55,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:55,383 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2025-04-28 21:21:55,383 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702
[2025-04-28 21:21:55,384 INFO  L87              Difference]: Start difference. First operand 28 states and 31 transitions. Second operand  has 27 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 27 states have internal predecessors, (32), 14 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (23), 11 states have call predecessors, (23), 14 states have call successors, (23)
[2025-04-28 21:21:55,576 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:55,576 INFO  L93              Difference]: Finished difference Result 30 states and 33 transitions.
[2025-04-28 21:21:55,578 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:55,578 INFO  L79                 Accepts]: Start accepts. Automaton has  has 27 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 27 states have internal predecessors, (32), 14 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (23), 11 states have call predecessors, (23), 14 states have call successors, (23) Word has length 37
[2025-04-28 21:21:55,579 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:55,579 INFO  L225             Difference]: With dead ends: 30
[2025-04-28 21:21:55,579 INFO  L226             Difference]: Without dead ends: 30
[2025-04-28 21:21:55,582 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992
[2025-04-28 21:21:55,583 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:55,583 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 183 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:55,584 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2025-04-28 21:21:55,587 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2025-04-28 21:21:55,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 10 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12)
[2025-04-28 21:21:55,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions.
[2025-04-28 21:21:55,588 INFO  L79                 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 37
[2025-04-28 21:21:55,588 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:55,588 INFO  L485      AbstractCegarLoop]: Abstraction has 30 states and 33 transitions.
[2025-04-28 21:21:55,588 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 27 states have internal predecessors, (32), 14 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (23), 11 states have call predecessors, (23), 14 states have call successors, (23)
[2025-04-28 21:21:55,588 INFO  L278                IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions.
[2025-04-28 21:21:55,590 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-04-28 21:21:55,590 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:55,590 INFO  L218           NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:55,594 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-04-28 21:21:55,792 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-04-28 21:21:55,792 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:55,792 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:55,792 INFO  L85        PathProgramCache]: Analyzing trace with hash 1986973059, now seen corresponding path program 6 times
[2025-04-28 21:21:55,792 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:55,792 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203236278]
[2025-04-28 21:21:55,792 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-04-28 21:21:55,792 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:55,801 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 5 equivalence classes.
[2025-04-28 21:21:55,812 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:55,812 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2025-04-28 21:21:55,813 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-04-28 21:21:55,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:55,990 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203236278]
[2025-04-28 21:21:55,990 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203236278] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:55,990 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625000684]
[2025-04-28 21:21:55,990 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-04-28 21:21:55,990 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:55,992 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:55,994 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:55,997 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:56,138 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 5 equivalence classes.
[2025-04-28 21:21:56,160 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:56,160 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2025-04-28 21:21:56,160 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:56,162 INFO  L256         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 17 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:56,166 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:56,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-04-28 21:21:56,208 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:57,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2025-04-28 21:21:57,929 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [625000684] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:57,929 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:57,929 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 16
[2025-04-28 21:21:57,929 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404167944]
[2025-04-28 21:21:57,929 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:57,929 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-04-28 21:21:57,930 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:57,930 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-04-28 21:21:57,930 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:57,931 INFO  L87              Difference]: Start difference. First operand 30 states and 33 transitions. Second operand  has 16 states, 7 states have (on average 2.857142857142857) internal successors, (20), 16 states have internal predecessors, (20), 11 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14)
[2025-04-28 21:21:58,048 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:58,048 INFO  L93              Difference]: Finished difference Result 32 states and 35 transitions.
[2025-04-28 21:21:58,049 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:58,049 INFO  L79                 Accepts]: Start accepts. Automaton has  has 16 states, 7 states have (on average 2.857142857142857) internal successors, (20), 16 states have internal predecessors, (20), 11 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) Word has length 41
[2025-04-28 21:21:58,049 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:58,050 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:58,050 INFO  L226             Difference]: Without dead ends: 32
[2025-04-28 21:21:58,050 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:21:58,051 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:58,051 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 110 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:58,052 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2025-04-28 21:21:58,055 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2025-04-28 21:21:58,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 11 states have return successors, (13), 11 states have call predecessors, (13), 5 states have call successors, (13)
[2025-04-28 21:21:58,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions.
[2025-04-28 21:21:58,056 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 41
[2025-04-28 21:21:58,056 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:58,056 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 35 transitions.
[2025-04-28 21:21:58,056 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 7 states have (on average 2.857142857142857) internal successors, (20), 16 states have internal predecessors, (20), 11 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14)
[2025-04-28 21:21:58,056 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions.
[2025-04-28 21:21:58,057 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2025-04-28 21:21:58,057 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:58,057 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:58,062 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:58,257 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2025-04-28 21:21:58,258 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:58,258 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:58,258 INFO  L85        PathProgramCache]: Analyzing trace with hash 602357512, now seen corresponding path program 7 times
[2025-04-28 21:21:58,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:58,258 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737605591]
[2025-04-28 21:21:58,258 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-04-28 21:21:58,258 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:58,263 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-04-28 21:21:58,270 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-04-28 21:21:58,270 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:58,270 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:58,488 INFO  L134       CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2025-04-28 21:21:58,489 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:58,489 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737605591]
[2025-04-28 21:21:58,489 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737605591] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:58,489 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257883833]
[2025-04-28 21:21:58,489 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-04-28 21:21:58,489 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:58,491 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:58,494 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:58,498 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:58,648 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-04-28 21:21:58,664 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-04-28 21:21:58,664 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:58,664 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:58,666 INFO  L256         TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:58,667 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:58,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2025-04-28 21:21:58,728 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:01,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2025-04-28 21:22:01,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [257883833] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:01,435 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:01,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 19
[2025-04-28 21:22:01,436 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395979938]
[2025-04-28 21:22:01,436 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:01,436 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-04-28 21:22:01,436 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:01,437 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-04-28 21:22:01,437 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:22:01,437 INFO  L87              Difference]: Start difference. First operand 32 states and 35 transitions. Second operand  has 19 states, 8 states have (on average 2.875) internal successors, (23), 19 states have internal predecessors, (23), 13 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (17), 8 states have call predecessors, (17), 13 states have call successors, (17)
[2025-04-28 21:22:01,560 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:01,560 INFO  L93              Difference]: Finished difference Result 34 states and 37 transitions.
[2025-04-28 21:22:01,560 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:22:01,561 INFO  L79                 Accepts]: Start accepts. Automaton has  has 19 states, 8 states have (on average 2.875) internal successors, (23), 19 states have internal predecessors, (23), 13 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (17), 8 states have call predecessors, (17), 13 states have call successors, (17) Word has length 45
[2025-04-28 21:22:01,561 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:01,561 INFO  L225             Difference]: With dead ends: 34
[2025-04-28 21:22:01,561 INFO  L226             Difference]: Without dead ends: 34
[2025-04-28 21:22:01,562 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:22:01,562 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:01,563 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 109 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:22:01,563 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2025-04-28 21:22:01,567 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2025-04-28 21:22:01,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 34 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 12 states have return successors, (14), 12 states have call predecessors, (14), 5 states have call successors, (14)
[2025-04-28 21:22:01,568 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions.
[2025-04-28 21:22:01,568 INFO  L79                 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 45
[2025-04-28 21:22:01,568 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:01,568 INFO  L485      AbstractCegarLoop]: Abstraction has 34 states and 37 transitions.
[2025-04-28 21:22:01,569 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 8 states have (on average 2.875) internal successors, (23), 19 states have internal predecessors, (23), 13 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (17), 8 states have call predecessors, (17), 13 states have call successors, (17)
[2025-04-28 21:22:01,569 INFO  L278                IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions.
[2025-04-28 21:22:01,569 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2025-04-28 21:22:01,570 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:01,570 INFO  L218           NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:01,574 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-04-28 21:22:01,772 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2025-04-28 21:22:01,772 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:01,773 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:01,773 INFO  L85        PathProgramCache]: Analyzing trace with hash 511226317, now seen corresponding path program 8 times
[2025-04-28 21:22:01,773 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:01,773 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842060058]
[2025-04-28 21:22:01,773 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:01,773 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:01,779 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes.
[2025-04-28 21:22:01,792 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements.
[2025-04-28 21:22:01,793 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:01,793 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:02,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 37 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2025-04-28 21:22:02,013 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:02,013 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842060058]
[2025-04-28 21:22:02,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842060058] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:02,013 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925062646]
[2025-04-28 21:22:02,013 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:02,013 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:02,015 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:02,017 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:22:02,021 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:22:02,207 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes.
[2025-04-28 21:22:02,233 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements.
[2025-04-28 21:22:02,233 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:02,234 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:02,234 INFO  L256         TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 23 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:02,238 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:02,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked.
[2025-04-28 21:22:02,287 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:06,458 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-04-28 21:22:06,458 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [925062646] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:06,458 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:06,458 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 16] total 20
[2025-04-28 21:22:06,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905936876]
[2025-04-28 21:22:06,458 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:06,459 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-04-28 21:22:06,459 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:06,459 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-04-28 21:22:06,460 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:22:06,460 INFO  L87              Difference]: Start difference. First operand 34 states and 37 transitions. Second operand  has 20 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 20 states have internal predecessors, (24), 13 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (18), 9 states have call predecessors, (18), 13 states have call successors, (18)
[2025-04-28 21:22:06,617 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:06,617 INFO  L93              Difference]: Finished difference Result 36 states and 39 transitions.
[2025-04-28 21:22:06,621 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:22:06,621 INFO  L79                 Accepts]: Start accepts. Automaton has  has 20 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 20 states have internal predecessors, (24), 13 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (18), 9 states have call predecessors, (18), 13 states have call successors, (18) Word has length 49
[2025-04-28 21:22:06,622 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:06,622 INFO  L225             Difference]: With dead ends: 36
[2025-04-28 21:22:06,623 INFO  L226             Difference]: Without dead ends: 36
[2025-04-28 21:22:06,623 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:22:06,623 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:06,624 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 127 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:22:06,624 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2025-04-28 21:22:06,627 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2025-04-28 21:22:06,627 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 13 states have return successors, (15), 13 states have call predecessors, (15), 5 states have call successors, (15)
[2025-04-28 21:22:06,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions.
[2025-04-28 21:22:06,628 INFO  L79                 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 49
[2025-04-28 21:22:06,628 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:06,628 INFO  L485      AbstractCegarLoop]: Abstraction has 36 states and 39 transitions.
[2025-04-28 21:22:06,629 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 20 states have internal predecessors, (24), 13 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (18), 9 states have call predecessors, (18), 13 states have call successors, (18)
[2025-04-28 21:22:06,629 INFO  L278                IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions.
[2025-04-28 21:22:06,630 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2025-04-28 21:22:06,630 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:06,630 INFO  L218           NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:06,635 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2025-04-28 21:22:06,830 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-04-28 21:22:06,830 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:06,831 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:06,831 INFO  L85        PathProgramCache]: Analyzing trace with hash -2036558382, now seen corresponding path program 9 times
[2025-04-28 21:22:06,831 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:06,831 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604823219]
[2025-04-28 21:22:06,831 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:22:06,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:06,838 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 7 equivalence classes.
[2025-04-28 21:22:06,846 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 45 of 53 statements.
[2025-04-28 21:22:06,846 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-04-28 21:22:06,846 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:06,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked.
[2025-04-28 21:22:06,986 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:06,986 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604823219]
[2025-04-28 21:22:06,986 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604823219] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:06,986 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43475752]
[2025-04-28 21:22:06,986 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:22:06,986 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:06,988 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:06,990 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:22:06,993 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-04-28 21:22:07,235 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 7 equivalence classes.
[2025-04-28 21:22:07,254 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 45 of 53 statements.
[2025-04-28 21:22:07,254 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-04-28 21:22:07,254 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:07,255 INFO  L256         TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:07,258 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:07,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked.
[2025-04-28 21:22:07,357 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
