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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:29,766 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:29,861 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f2044d-312d-418c-9c1a-9a91d918e224/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:29,865 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:29,866 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:29,888 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:29,889 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:29,889 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:29,890 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:29,890 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:29,890 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:29,890 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:29,890 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:29,891 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:29,891 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:29,891 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:29,891 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:29,891 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:29,891 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:29,892 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:29,892 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:29,892 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:29,892 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:29,892 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:29,892 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:29,893 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:29,893 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:30,255 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:30,268 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:30,271 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:30,273 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:30,274 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:30,276 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f2044d-312d-418c-9c1a-9a91d918e224/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-101.smt2
[2025-04-28 21:21:30,279 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:30,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:30,544 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82f2044d-312d-418c-9c1a-9a91d918e224/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-101.smt2
[2025-04-28 21:21:30,547 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:30,548 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:30,549 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:30,549 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:30,550 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:30,552 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,586 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30 Unit
[2025-04-28 21:21:30,587 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:30,588 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:30,589 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:30,590 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:30,606 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,606 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,637 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,638 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,641 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,643 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,649 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,650 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,651 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,667 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:30,671 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:30,671 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:30,671 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:30,672 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,675 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:30,691 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:30,709 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:30,712 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:30,732 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:30,732 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:30,732 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:30,732 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure CHC_COMP_FALSE given in one single declaration
[2025-04-28 21:21:30,732 INFO  L130     BoogieDeclarations]: Found specification of procedure CHC_COMP_FALSE
[2025-04-28 21:21:30,733 INFO  L138     BoogieDeclarations]: Found implementation of procedure CHC_COMP_FALSE
[2025-04-28 21:21:30,733 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_MAIN_0 given in one single declaration
[2025-04-28 21:21:30,733 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_MAIN_0
[2025-04-28 21:21:30,733 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_MAIN_0
[2025-04-28 21:21:30,733 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration
[2025-04-28 21:21:30,733 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_MAIN_1
[2025-04-28 21:21:30,733 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_MAIN_1
[2025-04-28 21:21:30,733 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:30,733 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:30,733 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:30,801 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:30,804 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:30,977 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:30,977 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:30,999 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:31,000 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-04-28 21:21:31,000 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:31 BoogieIcfgContainer
[2025-04-28 21:21:31,001 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:31,004 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:31,004 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:31,008 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:31,008 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:30" (1/3) ...
[2025-04-28 21:21:31,009 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b52be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:31, skipping insertion in model container
[2025-04-28 21:21:31,009 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (2/3) ...
[2025-04-28 21:21:31,009 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b52be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:31, skipping insertion in model container
[2025-04-28 21:21:31,010 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:31" (3/3) ...
[2025-04-28 21:21:31,011 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:31,027 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:31,029 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 5 procedures, 28 locations, 58 edges, 5 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:31,093 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:31,115 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;@75b34cca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:31,115 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:31,119 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 28 states, 9 states have (on average 2.111111111111111) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13)
[2025-04-28 21:21:31,133 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-04-28 21:21:31,134 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,134 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:31,135 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,143 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,143 INFO  L85        PathProgramCache]: Analyzing trace with hash 74941207, now seen corresponding path program 1 times
[2025-04-28 21:21:31,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,152 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042089548]
[2025-04-28 21:21:31,153 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,153 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,186 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-04-28 21:21:31,196 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-04-28 21:21:31,196 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,197 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,416 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:31,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,416 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042089548]
[2025-04-28 21:21:31,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042089548] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:31,417 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:31,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:31,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062036566]
[2025-04-28 21:21:31,427 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,434 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:31,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,465 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:31,465 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:31,467 INFO  L87              Difference]: Start difference. First operand  has 28 states, 9 states have (on average 2.111111111111111) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) Second operand  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:21:31,562 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:31,563 INFO  L93              Difference]: Finished difference Result 30 states and 47 transitions.
[2025-04-28 21:21:31,565 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:31,566 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 12
[2025-04-28 21:21:31,567 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:31,592 INFO  L225             Difference]: With dead ends: 30
[2025-04-28 21:21:31,593 INFO  L226             Difference]: Without dead ends: 30
[2025-04-28 21:21:31,595 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:31,598 INFO  L437           NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,603 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:31,621 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2025-04-28 21:21:31,675 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28.
[2025-04-28 21:21:31,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 9 states have (on average 2.0) internal successors, (18), 18 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14)
[2025-04-28 21:21:31,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions.
[2025-04-28 21:21:31,682 INFO  L79                 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 12
[2025-04-28 21:21:31,683 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,683 INFO  L485      AbstractCegarLoop]: Abstraction has 28 states and 45 transitions.
[2025-04-28 21:21:31,683 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:21:31,684 INFO  L278                IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions.
[2025-04-28 21:21:31,686 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:31,686 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,686 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:31,686 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:31,687 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,688 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,689 INFO  L85        PathProgramCache]: Analyzing trace with hash 479154073, now seen corresponding path program 1 times
[2025-04-28 21:21:31,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,689 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240974679]
[2025-04-28 21:21:31,689 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,697 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:31,738 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:31,738 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,738 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,194 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:32,194 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:32,194 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240974679]
[2025-04-28 21:21:32,194 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240974679] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:32,194 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:32,195 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:32,195 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307932512]
[2025-04-28 21:21:32,195 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:32,196 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:32,196 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:32,200 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:32,200 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:32,200 INFO  L87              Difference]: Start difference. First operand 28 states and 45 transitions. Second operand  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:32,470 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,470 INFO  L93              Difference]: Finished difference Result 36 states and 67 transitions.
[2025-04-28 21:21:32,471 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:32,471 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:32,471 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,473 INFO  L225             Difference]: With dead ends: 36
[2025-04-28 21:21:32,474 INFO  L226             Difference]: Without dead ends: 36
[2025-04-28 21:21:32,475 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:32,476 INFO  L437           NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,477 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 141 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:32,478 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2025-04-28 21:21:32,488 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32.
[2025-04-28 21:21:32,489 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 20 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24)
[2025-04-28 21:21:32,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 57 transitions.
[2025-04-28 21:21:32,490 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 57 transitions. Word has length 16
[2025-04-28 21:21:32,490 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,490 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 57 transitions.
[2025-04-28 21:21:32,491 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:32,491 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 57 transitions.
[2025-04-28 21:21:32,492 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:32,492 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,493 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:32,493 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:32,493 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,494 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,494 INFO  L85        PathProgramCache]: Analyzing trace with hash 1869839120, now seen corresponding path program 1 times
[2025-04-28 21:21:32,494 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,494 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938038591]
[2025-04-28 21:21:32,494 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,495 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,500 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:32,507 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:32,507 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,507 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,734 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:32,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:32,735 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938038591]
[2025-04-28 21:21:32,736 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938038591] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:32,736 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:32,736 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:32,736 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952058067]
[2025-04-28 21:21:32,737 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:32,737 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:32,737 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:32,738 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:32,738 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:32,738 INFO  L87              Difference]: Start difference. First operand 32 states and 57 transitions. Second operand  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:32,943 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,943 INFO  L93              Difference]: Finished difference Result 36 states and 66 transitions.
[2025-04-28 21:21:32,944 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:32,944 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:32,945 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,946 INFO  L225             Difference]: With dead ends: 36
[2025-04-28 21:21:32,946 INFO  L226             Difference]: Without dead ends: 36
[2025-04-28 21:21:32,946 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:32,948 INFO  L437           NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,948 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 146 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:32,949 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2025-04-28 21:21:32,955 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32.
[2025-04-28 21:21:32,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 20 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (23), 7 states have call predecessors, (23), 13 states have call successors, (23)
[2025-04-28 21:21:32,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions.
[2025-04-28 21:21:32,957 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 16
[2025-04-28 21:21:32,957 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,957 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 56 transitions.
[2025-04-28 21:21:32,958 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:32,958 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions.
[2025-04-28 21:21:32,959 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:32,959 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,959 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:32,960 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:32,960 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,960 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,960 INFO  L85        PathProgramCache]: Analyzing trace with hash -1187501717, now seen corresponding path program 1 times
[2025-04-28 21:21:32,961 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,961 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040405984]
[2025-04-28 21:21:32,961 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,961 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,966 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:32,970 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:32,970 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,971 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:33,126 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,127 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040405984]
[2025-04-28 21:21:33,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040405984] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:33,127 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:33,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:33,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361734930]
[2025-04-28 21:21:33,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,128 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:33,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,128 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:33,128 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:33,129 INFO  L87              Difference]: Start difference. First operand 32 states and 56 transitions. Second operand  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:33,332 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,332 INFO  L93              Difference]: Finished difference Result 40 states and 78 transitions.
[2025-04-28 21:21:33,333 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:33,333 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:33,333 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,334 INFO  L225             Difference]: With dead ends: 40
[2025-04-28 21:21:33,335 INFO  L226             Difference]: Without dead ends: 40
[2025-04-28 21:21:33,337 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:33,338 INFO  L437           NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,339 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 151 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:33,340 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2025-04-28 21:21:33,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36.
[2025-04-28 21:21:33,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 22 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 9 states have return successors, (33), 9 states have call predecessors, (33), 13 states have call successors, (33)
[2025-04-28 21:21:33,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 68 transitions.
[2025-04-28 21:21:33,350 INFO  L79                 Accepts]: Start accepts. Automaton has 36 states and 68 transitions. Word has length 16
[2025-04-28 21:21:33,350 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,350 INFO  L485      AbstractCegarLoop]: Abstraction has 36 states and 68 transitions.
[2025-04-28 21:21:33,350 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:33,351 INFO  L278                IsEmpty]: Start isEmpty. Operand 36 states and 68 transitions.
[2025-04-28 21:21:33,352 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:33,352 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,352 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,352 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:33,353 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,353 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,353 INFO  L85        PathProgramCache]: Analyzing trace with hash -1642124994, now seen corresponding path program 1 times
[2025-04-28 21:21:33,353 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,354 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387379770]
[2025-04-28 21:21:33,354 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,354 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,359 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:33,368 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:33,369 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,370 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,707 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:33,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,707 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387379770]
[2025-04-28 21:21:33,709 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387379770] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:33,709 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155803793]
[2025-04-28 21:21:33,709 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,710 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,712 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,716 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:33,720 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:33,767 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:33,787 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:33,787 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,787 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,793 INFO  L256         TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 45 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:33,804 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:34,122 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:34,122 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:35,403 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [155803793] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:35,403 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:35,404 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10
[2025-04-28 21:21:35,404 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028578458]
[2025-04-28 21:21:35,404 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:35,404 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:35,404 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:35,405 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:35,406 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:35,406 INFO  L87              Difference]: Start difference. First operand 36 states and 68 transitions. Second operand  has 10 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 9 states have internal predecessors, (12), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:35,808 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:35,808 INFO  L93              Difference]: Finished difference Result 46 states and 99 transitions.
[2025-04-28 21:21:35,809 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:35,809 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 9 states have internal predecessors, (12), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 20
[2025-04-28 21:21:35,809 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:35,810 INFO  L225             Difference]: With dead ends: 46
[2025-04-28 21:21:35,811 INFO  L226             Difference]: Without dead ends: 46
[2025-04-28 21:21:35,811 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:35,812 INFO  L437           NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:35,812 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 249 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:35,813 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2025-04-28 21:21:35,822 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38.
[2025-04-28 21:21:35,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 23 states have internal predecessors, (23), 13 states have call successors, (13), 4 states have call predecessors, (13), 10 states have return successors, (38), 10 states have call predecessors, (38), 13 states have call successors, (38)
[2025-04-28 21:21:35,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 74 transitions.
[2025-04-28 21:21:35,824 INFO  L79                 Accepts]: Start accepts. Automaton has 38 states and 74 transitions. Word has length 20
[2025-04-28 21:21:35,824 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:35,824 INFO  L485      AbstractCegarLoop]: Abstraction has 38 states and 74 transitions.
[2025-04-28 21:21:35,824 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 9 states have internal predecessors, (12), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:35,825 INFO  L278                IsEmpty]: Start isEmpty. Operand 38 states and 74 transitions.
[2025-04-28 21:21:35,828 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:35,828 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:35,828 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:35,833 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:36,032 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-04-28 21:21:36,033 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,033 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,033 INFO  L85        PathProgramCache]: Analyzing trace with hash -444629486, now seen corresponding path program 1 times
[2025-04-28 21:21:36,033 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,033 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581966583]
[2025-04-28 21:21:36,034 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,039 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:36,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:36,044 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,044 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,308 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:36,308 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,308 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581966583]
[2025-04-28 21:21:36,308 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581966583] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:36,308 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:36,308 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:36,309 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423510484]
[2025-04-28 21:21:36,309 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,310 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:36,310 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,310 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:36,312 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:36,313 INFO  L87              Difference]: Start difference. First operand 38 states and 74 transitions. Second operand  has 7 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:36,586 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,586 INFO  L93              Difference]: Finished difference Result 50 states and 112 transitions.
[2025-04-28 21:21:36,589 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:36,589 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) Word has length 20
[2025-04-28 21:21:36,589 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,590 INFO  L225             Difference]: With dead ends: 50
[2025-04-28 21:21:36,591 INFO  L226             Difference]: Without dead ends: 50
[2025-04-28 21:21:36,591 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:36,591 INFO  L437           NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,592 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 174 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:36,592 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2025-04-28 21:21:36,613 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42.
[2025-04-28 21:21:36,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 16 states have (on average 1.5625) internal successors, (25), 25 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 12 states have return successors, (49), 12 states have call predecessors, (49), 13 states have call successors, (49)
[2025-04-28 21:21:36,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 87 transitions.
[2025-04-28 21:21:36,618 INFO  L79                 Accepts]: Start accepts. Automaton has 42 states and 87 transitions. Word has length 20
[2025-04-28 21:21:36,619 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,619 INFO  L485      AbstractCegarLoop]: Abstraction has 42 states and 87 transitions.
[2025-04-28 21:21:36,619 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:36,619 INFO  L278                IsEmpty]: Start isEmpty. Operand 42 states and 87 transitions.
[2025-04-28 21:21:36,621 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:36,624 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,625 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:36,625 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-04-28 21:21:36,625 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,625 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,625 INFO  L85        PathProgramCache]: Analyzing trace with hash -424956161, now seen corresponding path program 1 times
[2025-04-28 21:21:36,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,626 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345061615]
[2025-04-28 21:21:36,626 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,633 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:36,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:36,647 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,647 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,879 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:36,879 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,879 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345061615]
[2025-04-28 21:21:36,879 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345061615] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:36,879 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230552419]
[2025-04-28 21:21:36,880 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,880 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:36,882 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:36,885 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:36,888 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:36,934 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:36,953 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:36,953 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,953 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,955 INFO  L256         TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 45 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:36,957 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:37,113 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,113 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:38,646 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:38,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230552419] provided 1 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:38,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:38,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 14
[2025-04-28 21:21:38,646 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543728504]
[2025-04-28 21:21:38,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:38,647 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:38,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:38,647 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:38,648 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:38,648 INFO  L87              Difference]: Start difference. First operand 42 states and 87 transitions. Second operand  has 8 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:38,889 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:38,889 INFO  L93              Difference]: Finished difference Result 52 states and 118 transitions.
[2025-04-28 21:21:38,889 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:38,890 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 20
[2025-04-28 21:21:38,890 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:38,891 INFO  L225             Difference]: With dead ends: 52
[2025-04-28 21:21:38,892 INFO  L226             Difference]: Without dead ends: 52
[2025-04-28 21:21:38,892 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:38,893 INFO  L437           NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:38,893 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 175 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:38,894 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2025-04-28 21:21:38,906 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44.
[2025-04-28 21:21:38,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 26 states have internal predecessors, (26), 13 states have call successors, (13), 4 states have call predecessors, (13), 13 states have return successors, (54), 13 states have call predecessors, (54), 13 states have call successors, (54)
[2025-04-28 21:21:38,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 93 transitions.
[2025-04-28 21:21:38,907 INFO  L79                 Accepts]: Start accepts. Automaton has 44 states and 93 transitions. Word has length 20
[2025-04-28 21:21:38,908 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,908 INFO  L485      AbstractCegarLoop]: Abstraction has 44 states and 93 transitions.
[2025-04-28 21:21:38,908 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:38,908 INFO  L278                IsEmpty]: Start isEmpty. Operand 44 states and 93 transitions.
[2025-04-28 21:21:38,909 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:38,909 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,910 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:38,917 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:39,114 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:39,114 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,114 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,115 INFO  L85        PathProgramCache]: Analyzing trace with hash 1354983754, now seen corresponding path program 1 times
[2025-04-28 21:21:39,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,115 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632130626]
[2025-04-28 21:21:39,115 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,119 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:39,123 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:39,123 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,123 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:39,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,184 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632130626]
[2025-04-28 21:21:39,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632130626] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:39,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:39,185 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:39,185 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849765773]
[2025-04-28 21:21:39,185 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,186 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:39,186 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,186 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:39,187 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:39,187 INFO  L87              Difference]: Start difference. First operand 44 states and 93 transitions. Second operand  has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:39,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,301 INFO  L93              Difference]: Finished difference Result 44 states and 91 transitions.
[2025-04-28 21:21:39,301 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:39,301 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 20
[2025-04-28 21:21:39,302 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,303 INFO  L225             Difference]: With dead ends: 44
[2025-04-28 21:21:39,303 INFO  L226             Difference]: Without dead ends: 43
[2025-04-28 21:21:39,304 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:39,304 INFO  L437           NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,305 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:39,305 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2025-04-28 21:21:39,312 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43.
[2025-04-28 21:21:39,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 43 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 25 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 13 states have return successors, (52), 13 states have call predecessors, (52), 12 states have call successors, (52)
[2025-04-28 21:21:39,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 89 transitions.
[2025-04-28 21:21:39,314 INFO  L79                 Accepts]: Start accepts. Automaton has 43 states and 89 transitions. Word has length 20
[2025-04-28 21:21:39,314 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,314 INFO  L485      AbstractCegarLoop]: Abstraction has 43 states and 89 transitions.
[2025-04-28 21:21:39,315 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:39,315 INFO  L278                IsEmpty]: Start isEmpty. Operand 43 states and 89 transitions.
[2025-04-28 21:21:39,316 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:39,316 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,316 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,316 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-04-28 21:21:39,316 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,317 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,317 INFO  L85        PathProgramCache]: Analyzing trace with hash -967970533, now seen corresponding path program 1 times
[2025-04-28 21:21:39,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,317 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908880993]
[2025-04-28 21:21:39,317 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,322 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:39,326 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:39,326 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,327 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,502 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:39,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,503 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908880993]
[2025-04-28 21:21:39,503 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908880993] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:39,503 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:39,503 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:39,503 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975874924]
[2025-04-28 21:21:39,503 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,504 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:39,504 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,504 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:39,504 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:39,504 INFO  L87              Difference]: Start difference. First operand 43 states and 89 transitions. Second operand  has 7 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:39,737 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,737 INFO  L93              Difference]: Finished difference Result 51 states and 112 transitions.
[2025-04-28 21:21:39,737 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:39,738 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) Word has length 20
[2025-04-28 21:21:39,738 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,739 INFO  L225             Difference]: With dead ends: 51
[2025-04-28 21:21:39,739 INFO  L226             Difference]: Without dead ends: 51
[2025-04-28 21:21:39,739 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:39,740 INFO  L437           NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,740 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 151 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:39,741 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2025-04-28 21:21:39,751 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43.
[2025-04-28 21:21:39,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 43 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 25 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 13 states have return successors, (50), 13 states have call predecessors, (50), 12 states have call successors, (50)
[2025-04-28 21:21:39,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 87 transitions.
[2025-04-28 21:21:39,752 INFO  L79                 Accepts]: Start accepts. Automaton has 43 states and 87 transitions. Word has length 20
[2025-04-28 21:21:39,752 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,752 INFO  L485      AbstractCegarLoop]: Abstraction has 43 states and 87 transitions.
[2025-04-28 21:21:39,756 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:39,756 INFO  L278                IsEmpty]: Start isEmpty. Operand 43 states and 87 transitions.
[2025-04-28 21:21:39,757 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:39,757 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,757 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,757 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-04-28 21:21:39,757 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,758 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,758 INFO  L85        PathProgramCache]: Analyzing trace with hash -1118783947, now seen corresponding path program 1 times
[2025-04-28 21:21:39,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,758 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498836173]
[2025-04-28 21:21:39,758 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,764 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:39,774 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:39,774 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,774 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,933 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,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,933 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498836173]
[2025-04-28 21:21:39,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498836173] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:39,934 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216685602]
[2025-04-28 21:21:39,934 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,934 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:39,937 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:39,939 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:39,942 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:39,984 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:40,003 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:40,003 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,003 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,006 INFO  L256         TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 27 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:40,007 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:40,089 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:40,090 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:41,032 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:41,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216685602] provided 1 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:41,034 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:41,034 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 14
[2025-04-28 21:21:41,035 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894851614]
[2025-04-28 21:21:41,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:41,035 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:41,035 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:41,036 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:41,036 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:41,036 INFO  L87              Difference]: Start difference. First operand 43 states and 87 transitions. Second operand  has 8 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:41,336 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:41,336 INFO  L93              Difference]: Finished difference Result 53 states and 119 transitions.
[2025-04-28 21:21:41,337 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:41,337 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 20
[2025-04-28 21:21:41,338 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:41,339 INFO  L225             Difference]: With dead ends: 53
[2025-04-28 21:21:41,339 INFO  L226             Difference]: Without dead ends: 53
[2025-04-28 21:21:41,340 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:41,341 INFO  L437           NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:41,341 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 159 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:41,342 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2025-04-28 21:21:41,359 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43.
[2025-04-28 21:21:41,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 43 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 25 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 13 states have return successors, (49), 13 states have call predecessors, (49), 12 states have call successors, (49)
[2025-04-28 21:21:41,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 86 transitions.
[2025-04-28 21:21:41,366 INFO  L79                 Accepts]: Start accepts. Automaton has 43 states and 86 transitions. Word has length 20
[2025-04-28 21:21:41,366 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:41,366 INFO  L485      AbstractCegarLoop]: Abstraction has 43 states and 86 transitions.
[2025-04-28 21:21:41,366 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:41,366 INFO  L278                IsEmpty]: Start isEmpty. Operand 43 states and 86 transitions.
[2025-04-28 21:21:41,367 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:41,368 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:41,368 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:41,374 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:41,569 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:41,569 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:41,570 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:41,570 INFO  L85        PathProgramCache]: Analyzing trace with hash -948297208, now seen corresponding path program 1 times
[2025-04-28 21:21:41,571 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:41,571 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305450436]
[2025-04-28 21:21:41,571 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:41,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:41,578 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:41,586 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:41,589 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:41,590 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,782 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:41,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:41,783 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305450436]
[2025-04-28 21:21:41,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305450436] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:41,783 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273363993]
[2025-04-28 21:21:41,783 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:41,783 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:41,786 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:41,789 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:41,793 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:41,842 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:41,856 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:41,856 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:41,856 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,858 INFO  L256         TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 33 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:41,859 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:41,952 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:41,952 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:42,950 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:42,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273363993] provided 1 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:42,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:42,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 15
[2025-04-28 21:21:42,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104982404]
[2025-04-28 21:21:42,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:42,951 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:42,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:42,952 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:42,952 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:42,952 INFO  L87              Difference]: Start difference. First operand 43 states and 86 transitions. Second operand  has 8 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:43,246 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:43,246 INFO  L93              Difference]: Finished difference Result 51 states and 110 transitions.
[2025-04-28 21:21:43,247 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:43,247 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 20
[2025-04-28 21:21:43,247 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:43,248 INFO  L225             Difference]: With dead ends: 51
[2025-04-28 21:21:43,248 INFO  L226             Difference]: Without dead ends: 51
[2025-04-28 21:21:43,249 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:43,251 INFO  L437           NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:43,251 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 176 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:43,252 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2025-04-28 21:21:43,267 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43.
[2025-04-28 21:21:43,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 43 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 25 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 13 states have return successors, (48), 13 states have call predecessors, (48), 12 states have call successors, (48)
[2025-04-28 21:21:43,272 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 85 transitions.
[2025-04-28 21:21:43,272 INFO  L79                 Accepts]: Start accepts. Automaton has 43 states and 85 transitions. Word has length 20
[2025-04-28 21:21:43,272 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:43,272 INFO  L485      AbstractCegarLoop]: Abstraction has 43 states and 85 transitions.
[2025-04-28 21:21:43,273 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:43,273 INFO  L278                IsEmpty]: Start isEmpty. Operand 43 states and 85 transitions.
[2025-04-28 21:21:43,273 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:43,274 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:43,274 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:43,282 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:43,474 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2025-04-28 21:21:43,475 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:43,475 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:43,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 1206982912, now seen corresponding path program 1 times
[2025-04-28 21:21:43,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:43,475 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126374829]
[2025-04-28 21:21:43,475 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:43,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:43,479 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:43,481 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:43,482 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:43,482 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:43,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:43,640 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:43,640 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126374829]
[2025-04-28 21:21:43,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126374829] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:43,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:43,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:43,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378841229]
[2025-04-28 21:21:43,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:43,641 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:43,641 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:43,641 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:43,642 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:43,642 INFO  L87              Difference]: Start difference. First operand 43 states and 85 transitions. Second operand  has 7 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:43,753 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:43,753 INFO  L93              Difference]: Finished difference Result 43 states and 81 transitions.
[2025-04-28 21:21:43,753 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:43,754 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 20
[2025-04-28 21:21:43,754 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:43,755 INFO  L225             Difference]: With dead ends: 43
[2025-04-28 21:21:43,755 INFO  L226             Difference]: Without dead ends: 41
[2025-04-28 21:21:43,755 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:43,756 INFO  L437           NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:43,756 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:43,757 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2025-04-28 21:21:43,764 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2025-04-28 21:21:43,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 23 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 13 states have return successors, (44), 13 states have call predecessors, (44), 10 states have call successors, (44)
[2025-04-28 21:21:43,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 77 transitions.
[2025-04-28 21:21:43,767 INFO  L79                 Accepts]: Start accepts. Automaton has 41 states and 77 transitions. Word has length 20
[2025-04-28 21:21:43,767 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:43,768 INFO  L485      AbstractCegarLoop]: Abstraction has 41 states and 77 transitions.
[2025-04-28 21:21:43,768 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:43,768 INFO  L278                IsEmpty]: Start isEmpty. Operand 41 states and 77 transitions.
[2025-04-28 21:21:43,769 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:43,772 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:43,773 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:43,773 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-04-28 21:21:43,773 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:43,773 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:43,773 INFO  L85        PathProgramCache]: Analyzing trace with hash -7966483, now seen corresponding path program 1 times
[2025-04-28 21:21:43,773 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:43,773 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260457779]
[2025-04-28 21:21:43,773 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:43,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:43,778 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:43,785 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:43,786 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:43,786 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:44,038 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:44,038 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260457779]
[2025-04-28 21:21:44,038 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260457779] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:44,038 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937163000]
[2025-04-28 21:21:44,038 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:44,038 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,041 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:44,043 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,045 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,096 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:44,113 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:44,114 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:44,114 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,115 INFO  L256         TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 50 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:44,117 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:44,134 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2025-04-28 21:21:44,324 INFO  L325             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2025-04-28 21:21:44,324 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15
[2025-04-28 21:21:44,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:44,329 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:44,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [937163000] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:44,330 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:44,330 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13
[2025-04-28 21:21:44,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303524074]
[2025-04-28 21:21:44,330 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:44,330 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:44,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:44,331 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:44,331 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:44,331 INFO  L87              Difference]: Start difference. First operand 41 states and 77 transitions. Second operand  has 6 states, 4 states have (on average 2.75) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:44,508 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:44,509 INFO  L93              Difference]: Finished difference Result 45 states and 94 transitions.
[2025-04-28 21:21:44,509 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:44,509 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.75) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:44,510 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:44,510 INFO  L225             Difference]: With dead ends: 45
[2025-04-28 21:21:44,510 INFO  L226             Difference]: Without dead ends: 45
[2025-04-28 21:21:44,511 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:44,511 INFO  L437           NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:44,512 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 100 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:44,512 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2025-04-28 21:21:44,522 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39.
[2025-04-28 21:21:44,522 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 16 states have (on average 1.375) internal successors, (22), 22 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 12 states have return successors, (39), 12 states have call predecessors, (39), 10 states have call successors, (39)
[2025-04-28 21:21:44,523 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions.
[2025-04-28 21:21:44,523 INFO  L79                 Accepts]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 24
[2025-04-28 21:21:44,523 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:44,524 INFO  L485      AbstractCegarLoop]: Abstraction has 39 states and 71 transitions.
[2025-04-28 21:21:44,524 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.75) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:44,524 INFO  L278                IsEmpty]: Start isEmpty. Operand 39 states and 71 transitions.
[2025-04-28 21:21:44,525 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:44,526 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:44,526 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:44,532 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:44,727 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,727 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:44,728 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:44,728 INFO  L85        PathProgramCache]: Analyzing trace with hash -561649555, now seen corresponding path program 2 times
[2025-04-28 21:21:44,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:44,728 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772541198]
[2025-04-28 21:21:44,728 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:44,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:44,733 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes.
[2025-04-28 21:21:44,736 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:44,737 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:44,737 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:44,779 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:44,779 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772541198]
[2025-04-28 21:21:44,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772541198] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:44,779 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:44,779 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:44,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285853080]
[2025-04-28 21:21:44,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:44,780 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:44,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:44,781 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:44,781 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:44,781 INFO  L87              Difference]: Start difference. First operand 39 states and 71 transitions. Second operand  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:44,910 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:44,911 INFO  L93              Difference]: Finished difference Result 63 states and 130 transitions.
[2025-04-28 21:21:44,911 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:44,911 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:44,912 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:44,913 INFO  L225             Difference]: With dead ends: 63
[2025-04-28 21:21:44,913 INFO  L226             Difference]: Without dead ends: 63
[2025-04-28 21:21:44,913 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:44,914 INFO  L437           NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:44,914 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 81 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:44,914 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2025-04-28 21:21:44,922 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53.
[2025-04-28 21:21:44,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 5 states have call predecessors, (13), 17 states have return successors, (63), 17 states have call predecessors, (63), 13 states have call successors, (63)
[2025-04-28 21:21:44,924 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 107 transitions.
[2025-04-28 21:21:44,924 INFO  L79                 Accepts]: Start accepts. Automaton has 53 states and 107 transitions. Word has length 24
[2025-04-28 21:21:44,924 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:44,924 INFO  L485      AbstractCegarLoop]: Abstraction has 53 states and 107 transitions.
[2025-04-28 21:21:44,924 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:44,924 INFO  L278                IsEmpty]: Start isEmpty. Operand 53 states and 107 transitions.
[2025-04-28 21:21:44,925 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:44,925 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:44,926 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:44,926 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-04-28 21:21:44,926 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:44,926 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:44,926 INFO  L85        PathProgramCache]: Analyzing trace with hash -2029892359, now seen corresponding path program 1 times
[2025-04-28 21:21:44,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:44,926 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098532428]
[2025-04-28 21:21:44,927 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:44,927 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:44,930 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:44,933 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:44,933 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:44,933 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:45,007 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:45,007 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098532428]
[2025-04-28 21:21:45,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098532428] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:45,007 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700595567]
[2025-04-28 21:21:45,007 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:45,008 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:45,010 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:45,012 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:45,017 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:45,066 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:45,084 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:45,084 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:45,084 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,085 INFO  L256         TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 17 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:45,086 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:45,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:45,114 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:45,487 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2025-04-28 21:21:45,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:45,499 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700595567] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:45,499 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:45,499 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 9
[2025-04-28 21:21:45,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311669795]
[2025-04-28 21:21:45,499 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:45,500 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:45,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:45,501 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:45,501 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:45,502 INFO  L87              Difference]: Start difference. First operand 53 states and 107 transitions. Second operand  has 9 states, 5 states have (on average 2.6) internal successors, (13), 9 states have internal predecessors, (13), 6 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8)
[2025-04-28 21:21:45,711 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:45,711 INFO  L93              Difference]: Finished difference Result 102 states and 238 transitions.
[2025-04-28 21:21:45,712 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:45,712 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 5 states have (on average 2.6) internal successors, (13), 9 states have internal predecessors, (13), 6 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 24
[2025-04-28 21:21:45,712 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:45,714 INFO  L225             Difference]: With dead ends: 102
[2025-04-28 21:21:45,714 INFO  L226             Difference]: Without dead ends: 102
[2025-04-28 21:21:45,715 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:45,715 INFO  L437           NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:45,718 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 133 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:45,718 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2025-04-28 21:21:45,734 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86.
[2025-04-28 21:21:45,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 86 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 50 states have internal predecessors, (52), 21 states have call successors, (21), 8 states have call predecessors, (21), 28 states have return successors, (127), 27 states have call predecessors, (127), 21 states have call successors, (127)
[2025-04-28 21:21:45,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 200 transitions.
[2025-04-28 21:21:45,738 INFO  L79                 Accepts]: Start accepts. Automaton has 86 states and 200 transitions. Word has length 24
[2025-04-28 21:21:45,739 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:45,739 INFO  L485      AbstractCegarLoop]: Abstraction has 86 states and 200 transitions.
[2025-04-28 21:21:45,739 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 5 states have (on average 2.6) internal successors, (13), 9 states have internal predecessors, (13), 6 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8)
[2025-04-28 21:21:45,739 INFO  L278                IsEmpty]: Start isEmpty. Operand 86 states and 200 transitions.
[2025-04-28 21:21:45,740 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:45,744 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:45,745 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:45,749 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-04-28 21:21:45,945 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-04-28 21:21:45,945 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:45,945 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:45,946 INFO  L85        PathProgramCache]: Analyzing trace with hash -208341577, now seen corresponding path program 1 times
[2025-04-28 21:21:45,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:45,946 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718853131]
[2025-04-28 21:21:45,946 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:45,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:45,949 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:45,954 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:45,954 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:45,954 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:46,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:46,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:46,158 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718853131]
[2025-04-28 21:21:46,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718853131] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:46,158 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335841442]
[2025-04-28 21:21:46,158 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:46,158 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:46,161 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:46,163 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:46,167 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:46,221 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:46,242 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:46,242 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:46,242 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:46,244 INFO  L256         TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 39 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:46,246 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:46,382 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:46,382 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:47,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335841442] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:47,844 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:47,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12
[2025-04-28 21:21:47,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885206565]
[2025-04-28 21:21:47,844 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:47,845 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-04-28 21:21:47,845 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:47,845 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-04-28 21:21:47,845 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:47,846 INFO  L87              Difference]: Start difference. First operand 86 states and 200 transitions. Second operand  has 12 states, 8 states have (on average 1.75) internal successors, (14), 11 states have internal predecessors, (14), 5 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10)
[2025-04-28 21:21:48,272 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:48,272 INFO  L93              Difference]: Finished difference Result 134 states and 317 transitions.
[2025-04-28 21:21:48,273 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:48,273 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 8 states have (on average 1.75) internal successors, (14), 11 states have internal predecessors, (14), 5 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 24
[2025-04-28 21:21:48,273 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:48,276 INFO  L225             Difference]: With dead ends: 134
[2025-04-28 21:21:48,276 INFO  L226             Difference]: Without dead ends: 134
[2025-04-28 21:21:48,276 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:48,279 INFO  L437           NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:48,280 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 162 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:48,280 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2025-04-28 21:21:48,311 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98.
[2025-04-28 21:21:48,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 42 states have (on average 1.380952380952381) internal successors, (58), 56 states have internal predecessors, (58), 21 states have call successors, (21), 8 states have call predecessors, (21), 34 states have return successors, (153), 33 states have call predecessors, (153), 21 states have call successors, (153)
[2025-04-28 21:21:48,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 232 transitions.
[2025-04-28 21:21:48,314 INFO  L79                 Accepts]: Start accepts. Automaton has 98 states and 232 transitions. Word has length 24
[2025-04-28 21:21:48,314 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:48,314 INFO  L485      AbstractCegarLoop]: Abstraction has 98 states and 232 transitions.
[2025-04-28 21:21:48,316 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 8 states have (on average 1.75) internal successors, (14), 11 states have internal predecessors, (14), 5 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10)
[2025-04-28 21:21:48,316 INFO  L278                IsEmpty]: Start isEmpty. Operand 98 states and 232 transitions.
[2025-04-28 21:21:48,319 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:48,320 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:48,321 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:48,327 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-04-28 21:21:48,521 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-04-28 21:21:48,521 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:48,522 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:48,522 INFO  L85        PathProgramCache]: Analyzing trace with hash -1734162624, now seen corresponding path program 1 times
[2025-04-28 21:21:48,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:48,522 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483510734]
[2025-04-28 21:21:48,522 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:48,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:48,526 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:48,530 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:48,530 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:48,530 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:48,788 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:48,788 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:48,789 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483510734]
[2025-04-28 21:21:48,789 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483510734] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:48,790 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098242268]
[2025-04-28 21:21:48,790 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:48,790 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:48,793 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:48,795 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:48,799 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:48,861 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:48,883 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:48,884 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:48,884 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:48,886 INFO  L256         TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 59 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:48,888 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:49,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:49,068 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:50,320 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098242268] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:50,320 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:50,320 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12
[2025-04-28 21:21:50,320 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329369670]
[2025-04-28 21:21:50,320 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:50,321 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-04-28 21:21:50,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:50,321 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-04-28 21:21:50,321 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:50,322 INFO  L87              Difference]: Start difference. First operand 98 states and 232 transitions. Second operand  has 12 states, 8 states have (on average 1.75) internal successors, (14), 11 states have internal predecessors, (14), 5 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10)
[2025-04-28 21:21:50,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:50,834 INFO  L93              Difference]: Finished difference Result 130 states and 304 transitions.
[2025-04-28 21:21:50,835 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:50,835 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 8 states have (on average 1.75) internal successors, (14), 11 states have internal predecessors, (14), 5 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 24
[2025-04-28 21:21:50,836 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:50,838 INFO  L225             Difference]: With dead ends: 130
[2025-04-28 21:21:50,838 INFO  L226             Difference]: Without dead ends: 130
[2025-04-28 21:21:50,839 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:50,839 INFO  L437           NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 11 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:50,840 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 233 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 316 Invalid, 6 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:21:50,840 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2025-04-28 21:21:50,858 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94.
[2025-04-28 21:21:50,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 40 states have (on average 1.4) internal successors, (56), 54 states have internal predecessors, (56), 21 states have call successors, (21), 8 states have call predecessors, (21), 32 states have return successors, (146), 31 states have call predecessors, (146), 21 states have call successors, (146)
[2025-04-28 21:21:50,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 223 transitions.
[2025-04-28 21:21:50,860 INFO  L79                 Accepts]: Start accepts. Automaton has 94 states and 223 transitions. Word has length 24
[2025-04-28 21:21:50,860 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:50,860 INFO  L485      AbstractCegarLoop]: Abstraction has 94 states and 223 transitions.
[2025-04-28 21:21:50,860 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 8 states have (on average 1.75) internal successors, (14), 11 states have internal predecessors, (14), 5 states have call successors, (6), 1 states have call predecessors, (6), 7 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10)
[2025-04-28 21:21:50,860 INFO  L278                IsEmpty]: Start isEmpty. Operand 94 states and 223 transitions.
[2025-04-28 21:21:50,862 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:50,862 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,862 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,868 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-04-28 21:21:51,067 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-04-28 21:21:51,067 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,067 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,068 INFO  L85        PathProgramCache]: Analyzing trace with hash 286546817, now seen corresponding path program 1 times
[2025-04-28 21:21:51,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,068 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222019502]
[2025-04-28 21:21:51,068 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,072 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:51,076 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:51,077 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,077 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:51,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,346 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222019502]
[2025-04-28 21:21:51,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222019502] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:51,346 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118513806]
[2025-04-28 21:21:51,347 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,347 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:51,349 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:51,351 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:51,355 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:21:51,412 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:51,428 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:51,428 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,428 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,430 INFO  L256         TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 59 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:51,431 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:51,596 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:51,596 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:53,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:53,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118513806] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:53,479 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:53,479 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17
[2025-04-28 21:21:53,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005685374]
[2025-04-28 21:21:53,480 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:53,481 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:53,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:53,482 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:53,482 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:53,482 INFO  L87              Difference]: Start difference. First operand 94 states and 223 transitions. Second operand  has 17 states, 9 states have (on average 2.111111111111111) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14)
[2025-04-28 21:21:54,410 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:54,410 INFO  L93              Difference]: Finished difference Result 182 states and 418 transitions.
[2025-04-28 21:21:54,411 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-04-28 21:21:54,411 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 9 states have (on average 2.111111111111111) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) Word has length 24
[2025-04-28 21:21:54,411 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:54,415 INFO  L225             Difference]: With dead ends: 182
[2025-04-28 21:21:54,416 INFO  L226             Difference]: Without dead ends: 182
[2025-04-28 21:21:54,416 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702
[2025-04-28 21:21:54,417 INFO  L437           NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:54,417 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 255 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:54,417 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 182 states.
[2025-04-28 21:21:54,437 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 96.
[2025-04-28 21:21:54,438 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 55 states have internal predecessors, (57), 21 states have call successors, (21), 8 states have call predecessors, (21), 33 states have return successors, (155), 32 states have call predecessors, (155), 21 states have call successors, (155)
[2025-04-28 21:21:54,439 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 233 transitions.
[2025-04-28 21:21:54,439 INFO  L79                 Accepts]: Start accepts. Automaton has 96 states and 233 transitions. Word has length 24
[2025-04-28 21:21:54,439 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:54,439 INFO  L485      AbstractCegarLoop]: Abstraction has 96 states and 233 transitions.
[2025-04-28 21:21:54,440 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 9 states have (on average 2.111111111111111) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14)
[2025-04-28 21:21:54,440 INFO  L278                IsEmpty]: Start isEmpty. Operand 96 states and 233 transitions.
[2025-04-28 21:21:54,441 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:54,441 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:54,442 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:54,447 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-04-28 21:21:54,646 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:54,646 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:54,646 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:54,646 INFO  L85        PathProgramCache]: Analyzing trace with hash -1239274230, now seen corresponding path program 1 times
[2025-04-28 21:21:54,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:54,646 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021261823]
[2025-04-28 21:21:54,646 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:54,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:54,653 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:54,658 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:54,659 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:54,659 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:54,840 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:54,840 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:54,840 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021261823]
[2025-04-28 21:21:54,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021261823] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:54,840 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084800846]
[2025-04-28 21:21:54,840 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:54,840 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:54,843 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:54,845 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:54,848 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-04-28 21:21:54,916 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:54,933 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:54,933 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:54,933 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:54,934 INFO  L256         TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 41 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:54,936 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:55,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:55,055 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:56,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:56,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084800846] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:56,219 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:56,219 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17
[2025-04-28 21:21:56,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533221299]
[2025-04-28 21:21:56,219 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:56,219 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:56,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:56,220 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:56,220 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:56,220 INFO  L87              Difference]: Start difference. First operand 96 states and 233 transitions. Second operand  has 17 states, 9 states have (on average 2.111111111111111) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14)
[2025-04-28 21:21:57,026 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:57,026 INFO  L93              Difference]: Finished difference Result 190 states and 463 transitions.
[2025-04-28 21:21:57,031 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-04-28 21:21:57,031 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 9 states have (on average 2.111111111111111) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) Word has length 24
[2025-04-28 21:21:57,035 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:57,042 INFO  L225             Difference]: With dead ends: 190
[2025-04-28 21:21:57,042 INFO  L226             Difference]: Without dead ends: 190
[2025-04-28 21:21:57,042 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:21:57,043 INFO  L437           NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:57,043 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 226 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:57,044 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 190 states.
[2025-04-28 21:21:57,083 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 98.
[2025-04-28 21:21:57,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 42 states have (on average 1.380952380952381) internal successors, (58), 56 states have internal predecessors, (58), 21 states have call successors, (21), 8 states have call predecessors, (21), 34 states have return successors, (164), 33 states have call predecessors, (164), 21 states have call successors, (164)
[2025-04-28 21:21:57,085 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 243 transitions.
[2025-04-28 21:21:57,085 INFO  L79                 Accepts]: Start accepts. Automaton has 98 states and 243 transitions. Word has length 24
[2025-04-28 21:21:57,085 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:57,086 INFO  L485      AbstractCegarLoop]: Abstraction has 98 states and 243 transitions.
[2025-04-28 21:21:57,086 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 9 states have (on average 2.111111111111111) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14)
[2025-04-28 21:21:57,086 INFO  L278                IsEmpty]: Start isEmpty. Operand 98 states and 243 transitions.
[2025-04-28 21:21:57,087 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:57,088 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:57,088 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:57,094 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2025-04-28 21:21:57,288 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:57,289 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:57,289 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:57,289 INFO  L85        PathProgramCache]: Analyzing trace with hash 1039487351, now seen corresponding path program 2 times
[2025-04-28 21:21:57,289 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:57,289 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665979581]
[2025-04-28 21:21:57,289 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:57,290 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:57,293 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes.
[2025-04-28 21:21:57,295 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:57,296 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:57,296 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:57,332 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:57,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:57,333 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665979581]
[2025-04-28 21:21:57,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665979581] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:57,333 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:57,333 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:57,333 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243105774]
[2025-04-28 21:21:57,333 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:57,334 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:57,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:57,334 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:57,334 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:57,334 INFO  L87              Difference]: Start difference. First operand 98 states and 243 transitions. Second operand  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:57,453 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:57,453 INFO  L93              Difference]: Finished difference Result 112 states and 253 transitions.
[2025-04-28 21:21:57,453 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:57,454 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:57,454 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:57,455 INFO  L225             Difference]: With dead ends: 112
[2025-04-28 21:21:57,455 INFO  L226             Difference]: Without dead ends: 106
[2025-04-28 21:21:57,456 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:57,456 INFO  L437           NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:57,457 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 81 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:57,457 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2025-04-28 21:21:57,467 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94.
[2025-04-28 21:21:57,468 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 40 states have (on average 1.4) internal successors, (56), 54 states have internal predecessors, (56), 21 states have call successors, (21), 8 states have call predecessors, (21), 32 states have return successors, (135), 31 states have call predecessors, (135), 21 states have call successors, (135)
[2025-04-28 21:21:57,469 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 212 transitions.
[2025-04-28 21:21:57,469 INFO  L79                 Accepts]: Start accepts. Automaton has 94 states and 212 transitions. Word has length 24
[2025-04-28 21:21:57,469 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:57,469 INFO  L485      AbstractCegarLoop]: Abstraction has 94 states and 212 transitions.
[2025-04-28 21:21:57,470 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:57,470 INFO  L278                IsEmpty]: Start isEmpty. Operand 94 states and 212 transitions.
[2025-04-28 21:21:57,471 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-04-28 21:21:57,471 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:57,471 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:57,471 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-04-28 21:21:57,472 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:57,472 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:57,472 INFO  L85        PathProgramCache]: Analyzing trace with hash 286376827, now seen corresponding path program 1 times
[2025-04-28 21:21:57,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:57,472 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721237813]
[2025-04-28 21:21:57,472 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:57,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:57,497 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:57,500 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:57,500 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:57,500 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:57,653 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-04-28 21:21:57,653 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:57,653 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721237813]
[2025-04-28 21:21:57,653 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721237813] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:57,653 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:57,653 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:57,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727772602]
[2025-04-28 21:21:57,653 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:57,654 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:57,654 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:57,654 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:57,654 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:57,654 INFO  L87              Difference]: Start difference. First operand 94 states and 212 transitions. Second operand  has 7 states, 4 states have (on average 2.5) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:57,760 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:57,760 INFO  L93              Difference]: Finished difference Result 98 states and 220 transitions.
[2025-04-28 21:21:57,761 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:57,761 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 4 states have (on average 2.5) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28
[2025-04-28 21:21:57,761 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:57,763 INFO  L225             Difference]: With dead ends: 98
[2025-04-28 21:21:57,763 INFO  L226             Difference]: Without dead ends: 97
[2025-04-28 21:21:57,763 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:57,764 INFO  L437           NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:57,764 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:57,764 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2025-04-28 21:21:57,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87.
[2025-04-28 21:21:57,774 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 87 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 50 states have internal predecessors, (52), 20 states have call successors, (20), 8 states have call predecessors, (20), 29 states have return successors, (116), 28 states have call predecessors, (116), 20 states have call successors, (116)
[2025-04-28 21:21:57,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 188 transitions.
[2025-04-28 21:21:57,775 INFO  L79                 Accepts]: Start accepts. Automaton has 87 states and 188 transitions. Word has length 28
[2025-04-28 21:21:57,775 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:57,775 INFO  L485      AbstractCegarLoop]: Abstraction has 87 states and 188 transitions.
[2025-04-28 21:21:57,775 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 4 states have (on average 2.5) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:57,776 INFO  L278                IsEmpty]: Start isEmpty. Operand 87 states and 188 transitions.
[2025-04-28 21:21:57,777 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-04-28 21:21:57,777 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:57,777 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:57,777 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-04-28 21:21:57,777 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:57,778 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:57,778 INFO  L85        PathProgramCache]: Analyzing trace with hash -66529120, now seen corresponding path program 1 times
[2025-04-28 21:21:57,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:57,778 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312570170]
[2025-04-28 21:21:57,778 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:57,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:57,782 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:57,784 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:57,784 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:57,784 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:57,858 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:57,858 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:57,858 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312570170]
[2025-04-28 21:21:57,858 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312570170] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:57,858 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322110251]
[2025-04-28 21:21:57,858 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:57,858 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:57,860 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:57,862 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:57,868 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-04-28 21:21:57,943 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:57,963 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:57,964 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:57,964 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:57,965 INFO  L256         TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:57,966 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:58,005 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:58,006 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:58,433 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4
[2025-04-28 21:21:58,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:58,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322110251] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:58,442 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:58,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 10
[2025-04-28 21:21:58,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650132130]
[2025-04-28 21:21:58,442 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:58,442 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:58,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:58,443 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:58,443 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:58,443 INFO  L87              Difference]: Start difference. First operand 87 states and 188 transitions. Second operand  has 10 states, 6 states have (on average 2.5) internal successors, (15), 10 states have internal predecessors, (15), 6 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9)
[2025-04-28 21:21:58,864 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:58,864 INFO  L93              Difference]: Finished difference Result 231 states and 642 transitions.
[2025-04-28 21:21:58,865 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-04-28 21:21:58,865 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), 6 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 28
[2025-04-28 21:21:58,865 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:58,869 INFO  L225             Difference]: With dead ends: 231
[2025-04-28 21:21:58,869 INFO  L226             Difference]: Without dead ends: 198
[2025-04-28 21:21:58,869 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:58,871 INFO  L437           NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:58,871 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 170 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:21:58,872 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2025-04-28 21:21:58,899 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 148.
[2025-04-28 21:21:58,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 148 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 86 states have internal predecessors, (91), 36 states have call successors, (36), 15 states have call predecessors, (36), 48 states have return successors, (249), 46 states have call predecessors, (249), 36 states have call successors, (249)
[2025-04-28 21:21:58,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 376 transitions.
[2025-04-28 21:21:58,902 INFO  L79                 Accepts]: Start accepts. Automaton has 148 states and 376 transitions. Word has length 28
[2025-04-28 21:21:58,902 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:58,902 INFO  L485      AbstractCegarLoop]: Abstraction has 148 states and 376 transitions.
[2025-04-28 21:21:58,902 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), 6 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9)
[2025-04-28 21:21:58,902 INFO  L278                IsEmpty]: Start isEmpty. Operand 148 states and 376 transitions.
[2025-04-28 21:21:58,904 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-04-28 21:21:58,904 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:58,905 INFO  L218           NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:58,910 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2025-04-28 21:21:59,105 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2025-04-28 21:21:59,105 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:59,106 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:59,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 210540655, now seen corresponding path program 1 times
[2025-04-28 21:21:59,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:59,106 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154948660]
[2025-04-28 21:21:59,106 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:59,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:59,111 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:59,115 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:59,116 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:59,116 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:59,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:59,186 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:59,187 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154948660]
[2025-04-28 21:21:59,187 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154948660] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:59,187 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:59,187 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:59,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875551392]
[2025-04-28 21:21:59,187 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:59,187 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:59,187 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:59,188 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:59,188 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:59,188 INFO  L87              Difference]: Start difference. First operand 148 states and 376 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:21:59,309 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:59,309 INFO  L93              Difference]: Finished difference Result 199 states and 462 transitions.
[2025-04-28 21:21:59,310 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:59,310 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 28
[2025-04-28 21:21:59,310 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:59,313 INFO  L225             Difference]: With dead ends: 199
[2025-04-28 21:21:59,313 INFO  L226             Difference]: Without dead ends: 167
[2025-04-28 21:21:59,313 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:59,313 INFO  L437           NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:59,314 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 73 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:59,315 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 167 states.
[2025-04-28 21:21:59,333 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144.
[2025-04-28 21:21:59,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 144 states, 64 states have (on average 1.375) internal successors, (88), 81 states have internal predecessors, (88), 30 states have call successors, (30), 15 states have call predecessors, (30), 49 states have return successors, (178), 47 states have call predecessors, (178), 30 states have call successors, (178)
[2025-04-28 21:21:59,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 296 transitions.
[2025-04-28 21:21:59,337 INFO  L79                 Accepts]: Start accepts. Automaton has 144 states and 296 transitions. Word has length 28
[2025-04-28 21:21:59,337 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:59,337 INFO  L485      AbstractCegarLoop]: Abstraction has 144 states and 296 transitions.
[2025-04-28 21:21:59,337 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:21:59,337 INFO  L278                IsEmpty]: Start isEmpty. Operand 144 states and 296 transitions.
[2025-04-28 21:21:59,340 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-04-28 21:21:59,340 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:59,340 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:59,341 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-04-28 21:21:59,341 INFO  L403      AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:59,341 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:59,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 1635961001, now seen corresponding path program 1 times
[2025-04-28 21:21:59,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:59,342 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303658938]
[2025-04-28 21:21:59,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:59,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:59,349 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:59,354 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:59,354 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:59,354 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
