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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:53,116 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:53,221 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efcb0fa1-3911-44ca-8004-ef9f03c43638/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:53,231 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:53,231 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:53,262 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:53,263 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:53,263 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:53,263 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:53,263 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:53,264 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:53,264 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:53,264 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:53,264 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:53,264 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:53,264 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:53,264 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:53,264 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:53,264 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:53,265 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:53,265 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:53,265 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:53,265 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:53,265 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:53,265 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:53,266 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:53,266 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:53,624 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:53,639 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:53,642 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:53,644 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:53,645 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:53,646 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efcb0fa1-3911-44ca-8004-ef9f03c43638/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-055.smt2
[2025-04-28 21:21:53,650 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:53,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:53,967 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efcb0fa1-3911-44ca-8004-ef9f03c43638/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-055.smt2
[2025-04-28 21:21:53,973 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:53,974 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:53,976 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:53,976 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:53,977 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:53,979 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:53" (1/1) ...
[2025-04-28 21:21:54,021 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:54 Unit
[2025-04-28 21:21:54,021 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:54,023 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:54,023 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:54,023 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:54,044 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:54" (1/1) ...
[2025-04-28 21:21:54,044 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:54" (1/1) ...
[2025-04-28 21:21:54,076 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:54" (1/1) ...
[2025-04-28 21:21:54,080 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:54" (1/1) ...
[2025-04-28 21:21:54,087 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:54" (1/1) ...
[2025-04-28 21:21:54,088 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:54" (1/1) ...
[2025-04-28 21:21:54,089 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:54" (1/1) ...
[2025-04-28 21:21:54,091 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:54" (1/1) ...
[2025-04-28 21:21:54,091 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:54" (1/1) ...
[2025-04-28 21:21:54,105 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:54,106 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:54,106 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:54,106 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:54,107 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:54" (1/1) ...
[2025-04-28 21:21:54,110 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:54,124 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:54,138 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:54,142 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:54,154 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:54,155 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:54,155 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:54,155 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATverifier.error.split given in one single declaration
[2025-04-28 21:21:54,155 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATverifier.error.split
[2025-04-28 21:21:54,155 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATverifier.error.split
[2025-04-28 21:21:54,155 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb22.i given in one single declaration
[2025-04-28 21:21:54,155 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb22.i
[2025-04-28 21:21:54,155 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb22.i
[2025-04-28 21:21:54,155 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb9.i given in one single declaration
[2025-04-28 21:21:54,155 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb9.i
[2025-04-28 21:21:54,155 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb9.i
[2025-04-28 21:21:54,156 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-04-28 21:21:54,156 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-04-28 21:21:54,156 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-04-28 21:21:54,156 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:54,156 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:54,156 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:54,219 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:54,223 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:54,391 INFO  L?                        ?]: Removed 51 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:54,391 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:54,412 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:54,412 INFO  L312             CfgBuilder]: Removed 2 assume(true) statements.
[2025-04-28 21:21:54,412 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:54 BoogieIcfgContainer
[2025-04-28 21:21:54,413 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:54,417 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:54,417 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:54,421 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:54,422 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:53" (1/3) ...
[2025-04-28 21:21:54,423 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612c546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:54, skipping insertion in model container
[2025-04-28 21:21:54,423 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:54" (2/3) ...
[2025-04-28 21:21:54,423 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612c546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:54, skipping insertion in model container
[2025-04-28 21:21:54,424 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:54" (3/3) ...
[2025-04-28 21:21:54,425 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:54,443 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:54,446 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 6 procedures, 24 locations, 34 edges, 6 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:54,501 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:54,517 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@12836886, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:54,517 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:54,525 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 24 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7)
[2025-04-28 21:21:54,533 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-28 21:21:54,534 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:54,534 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:54,535 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:54,541 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:54,541 INFO  L85        PathProgramCache]: Analyzing trace with hash -687099151, now seen corresponding path program 1 times
[2025-04-28 21:21:54,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:54,551 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867692287]
[2025-04-28 21:21:54,551 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:54,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:54,598 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:54,639 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:54,641 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:54,642 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,238 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:55,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:55,241 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867692287]
[2025-04-28 21:21:55,242 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867692287] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:55,242 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:55,245 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:55,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924180970]
[2025-04-28 21:21:55,249 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:55,259 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:55,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:55,301 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:55,302 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:55,305 INFO  L87              Difference]: Start difference. First operand  has 24 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand  has 6 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), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:55,446 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:55,446 INFO  L93              Difference]: Finished difference Result 28 states and 33 transitions.
[2025-04-28 21:21:55,449 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:55,450 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 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), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 19
[2025-04-28 21:21:55,450 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:55,462 INFO  L225             Difference]: With dead ends: 28
[2025-04-28 21:21:55,462 INFO  L226             Difference]: Without dead ends: 28
[2025-04-28 21:21:55,492 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:55,501 INFO  L437           NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:55,502 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 95 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:55,520 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2025-04-28 21:21:55,578 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26.
[2025-04-28 21:21:55,579 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10)
[2025-04-28 21:21:55,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions.
[2025-04-28 21:21:55,591 INFO  L79                 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19
[2025-04-28 21:21:55,591 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:55,591 INFO  L485      AbstractCegarLoop]: Abstraction has 26 states and 30 transitions.
[2025-04-28 21:21:55,592 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 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), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:55,592 INFO  L278                IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions.
[2025-04-28 21:21:55,593 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2025-04-28 21:21:55,593 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:55,594 INFO  L218           NwaCegarLoop]: trace histogram [2, 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:55,594 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:55,595 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:55,596 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:55,598 INFO  L85        PathProgramCache]: Analyzing trace with hash 728162285, now seen corresponding path program 1 times
[2025-04-28 21:21:55,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:55,598 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919674381]
[2025-04-28 21:21:55,598 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:55,599 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:55,621 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-04-28 21:21:55,650 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-04-28 21:21:55,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:55,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:56,180 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:56,181 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:56,181 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919674381]
[2025-04-28 21:21:56,181 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919674381] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:56,181 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866231338]
[2025-04-28 21:21:56,182 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:56,182 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:56,185 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:56,188 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:56,194 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:56,260 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-04-28 21:21:56,296 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-04-28 21:21:56,296 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:56,296 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:56,301 INFO  L256         TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 27 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:56,308 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:56,579 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:56,580 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:58,401 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:58,401 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866231338] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:58,402 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:58,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16
[2025-04-28 21:21:58,403 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403359576]
[2025-04-28 21:21:58,403 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:58,404 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-04-28 21:21:58,404 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:58,405 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-04-28 21:21:58,407 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:58,407 INFO  L87              Difference]: Start difference. First operand 26 states and 30 transitions. Second operand  has 16 states, 8 states have (on average 2.5) internal successors, (20), 16 states have internal predecessors, (20), 11 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13)
[2025-04-28 21:21:58,590 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:58,591 INFO  L93              Difference]: Finished difference Result 32 states and 38 transitions.
[2025-04-28 21:21:58,591 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:58,591 INFO  L79                 Accepts]: Start accepts. Automaton has  has 16 states, 8 states have (on average 2.5) internal successors, (20), 16 states have internal predecessors, (20), 11 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) Word has length 23
[2025-04-28 21:21:58,592 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:58,593 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:58,593 INFO  L226             Difference]: Without dead ends: 32
[2025-04-28 21:21:58,593 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:58,594 INFO  L437           NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:58,595 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 240 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:58,598 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2025-04-28 21:21:58,605 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28.
[2025-04-28 21:21:58,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 7 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12)
[2025-04-28 21:21:58,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions.
[2025-04-28 21:21:58,607 INFO  L79                 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 23
[2025-04-28 21:21:58,607 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:58,607 INFO  L485      AbstractCegarLoop]: Abstraction has 28 states and 33 transitions.
[2025-04-28 21:21:58,609 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 8 states have (on average 2.5) internal successors, (20), 16 states have internal predecessors, (20), 11 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13)
[2025-04-28 21:21:58,609 INFO  L278                IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions.
[2025-04-28 21:21:58,611 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2025-04-28 21:21:58,611 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:58,611 INFO  L218           NwaCegarLoop]: trace histogram [2, 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,619 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:58,812 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:58,812 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:58,813 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:58,813 INFO  L85        PathProgramCache]: Analyzing trace with hash -339084765, now seen corresponding path program 1 times
[2025-04-28 21:21:58,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:58,813 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509586709]
[2025-04-28 21:21:58,813 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:58,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:58,821 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-04-28 21:21:58,832 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-04-28 21:21:58,832 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:58,832 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:59,251 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:59,251 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:59,252 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509586709]
[2025-04-28 21:21:59,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509586709] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:59,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:59,252 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:59,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745493136]
[2025-04-28 21:21:59,252 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:59,252 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:59,252 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:59,253 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:59,253 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:59,253 INFO  L87              Difference]: Start difference. First operand 28 states and 33 transitions. Second operand  has 8 states, 5 states have (on average 2.2) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6)
[2025-04-28 21:21:59,375 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:59,375 INFO  L93              Difference]: Finished difference Result 34 states and 40 transitions.
[2025-04-28 21:21:59,375 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:59,376 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 2.2) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 23
[2025-04-28 21:21:59,376 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:59,377 INFO  L225             Difference]: With dead ends: 34
[2025-04-28 21:21:59,377 INFO  L226             Difference]: Without dead ends: 30
[2025-04-28 21:21:59,377 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:59,378 INFO  L437           NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:59,379 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 110 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:59,380 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2025-04-28 21:21:59,384 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28.
[2025-04-28 21:21:59,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 7 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11)
[2025-04-28 21:21:59,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions.
[2025-04-28 21:21:59,385 INFO  L79                 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23
[2025-04-28 21:21:59,386 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:59,386 INFO  L485      AbstractCegarLoop]: Abstraction has 28 states and 32 transitions.
[2025-04-28 21:21:59,386 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 2.2) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6)
[2025-04-28 21:21:59,386 INFO  L278                IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions.
[2025-04-28 21:21:59,387 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-04-28 21:21:59,387 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:59,387 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:59,387 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:59,388 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:59,388 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:59,388 INFO  L85        PathProgramCache]: Analyzing trace with hash 173720607, now seen corresponding path program 1 times
[2025-04-28 21:21:59,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:59,389 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305179451]
[2025-04-28 21:21:59,389 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:59,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:59,403 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-04-28 21:21:59,424 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:59,424 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:59,424 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:59,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:59,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:59,877 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305179451]
[2025-04-28 21:21:59,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305179451] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:59,877 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217957860]
[2025-04-28 21:21:59,877 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:59,877 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:59,880 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:59,882 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:59,886 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:59,952 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-04-28 21:21:59,981 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:59,981 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:59,981 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:59,983 INFO  L256         TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:59,985 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:00,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:22:00,192 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:02,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:22:02,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217957860] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:02,950 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:02,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21
[2025-04-28 21:22:02,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38357206]
[2025-04-28 21:22:02,951 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:02,952 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-04-28 21:22:02,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:02,954 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-04-28 21:22:02,955 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420
[2025-04-28 21:22:02,955 INFO  L87              Difference]: Start difference. First operand 28 states and 32 transitions. Second operand  has 21 states, 10 states have (on average 2.5) internal successors, (25), 21 states have internal predecessors, (25), 14 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (16), 9 states have call predecessors, (16), 14 states have call successors, (16)
[2025-04-28 21:22:03,196 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:03,196 INFO  L93              Difference]: Finished difference Result 32 states and 37 transitions.
[2025-04-28 21:22:03,197 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:22:03,197 INFO  L79                 Accepts]: Start accepts. Automaton has  has 21 states, 10 states have (on average 2.5) internal successors, (25), 21 states have internal predecessors, (25), 14 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (16), 9 states have call predecessors, (16), 14 states have call successors, (16) Word has length 27
[2025-04-28 21:22:03,198 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:03,198 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:22:03,198 INFO  L226             Difference]: Without dead ends: 28
[2025-04-28 21:22:03,199 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:22:03,200 INFO  L437           NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:03,200 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 263 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:22:03,204 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2025-04-28 21:22:03,210 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26.
[2025-04-28 21:22:03,211 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9)
[2025-04-28 21:22:03,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions.
[2025-04-28 21:22:03,212 INFO  L79                 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 27
[2025-04-28 21:22:03,212 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:03,212 INFO  L485      AbstractCegarLoop]: Abstraction has 26 states and 29 transitions.
[2025-04-28 21:22:03,212 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 10 states have (on average 2.5) internal successors, (25), 21 states have internal predecessors, (25), 14 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (16), 9 states have call predecessors, (16), 14 states have call successors, (16)
[2025-04-28 21:22:03,213 INFO  L278                IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2025-04-28 21:22:03,213 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-04-28 21:22:03,213 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:03,214 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:03,220 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:22:03,417 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:03,418 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:03,418 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:03,418 INFO  L85        PathProgramCache]: Analyzing trace with hash 1141849961, now seen corresponding path program 2 times
[2025-04-28 21:22:03,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:03,419 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012487251]
[2025-04-28 21:22:03,419 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:03,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:03,429 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes.
[2025-04-28 21:22:03,458 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:22:03,459 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:03,459 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:04,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:22:04,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:04,509 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012487251]
[2025-04-28 21:22:04,509 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012487251] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:04,509 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21070842]
[2025-04-28 21:22:04,509 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:04,509 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:04,512 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:04,514 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:22:04,518 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:22:04,588 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes.
[2025-04-28 21:22:04,617 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:22:04,617 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:04,618 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:04,620 INFO  L256         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 61 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:04,625 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:04,835 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2025-04-28 21:22:04,950 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 25 treesize of output 14
[2025-04-28 21:22:05,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:22:05,136 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:08,322 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:22:08,323 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1
[2025-04-28 21:22:08,403 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [21070842] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:08,403 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:22:08,403 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18
[2025-04-28 21:22:08,403 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202136873]
[2025-04-28 21:22:08,403 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:08,404 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-04-28 21:22:08,404 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:08,405 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-04-28 21:22:08,405 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:22:08,405 INFO  L87              Difference]: Start difference. First operand 26 states and 29 transitions. Second operand  has 18 states, 10 states have (on average 2.2) internal successors, (22), 18 states have internal predecessors, (22), 11 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12)
[2025-04-28 21:22:08,771 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:08,771 INFO  L93              Difference]: Finished difference Result 32 states and 37 transitions.
[2025-04-28 21:22:08,773 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:22:08,773 INFO  L79                 Accepts]: Start accepts. Automaton has  has 18 states, 10 states have (on average 2.2) internal successors, (22), 18 states have internal predecessors, (22), 11 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) Word has length 27
[2025-04-28 21:22:08,774 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:08,774 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:22:08,774 INFO  L226             Difference]: Without dead ends: 32
[2025-04-28 21:22:08,775 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:22:08,776 INFO  L437           NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:08,776 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 196 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:22:08,777 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2025-04-28 21:22:08,781 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30.
[2025-04-28 21:22:08,781 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12)
[2025-04-28 21:22:08,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions.
[2025-04-28 21:22:08,782 INFO  L79                 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27
[2025-04-28 21:22:08,782 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:08,782 INFO  L485      AbstractCegarLoop]: Abstraction has 30 states and 34 transitions.
[2025-04-28 21:22:08,782 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 10 states have (on average 2.2) internal successors, (22), 18 states have internal predecessors, (22), 11 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12)
[2025-04-28 21:22:08,782 INFO  L278                IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions.
[2025-04-28 21:22:08,783 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-04-28 21:22:08,783 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:08,783 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, 1, 1, 1]
[2025-04-28 21:22:08,788 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:22:08,985 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:08,985 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:08,986 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:08,986 INFO  L85        PathProgramCache]: Analyzing trace with hash 106963099, now seen corresponding path program 2 times
[2025-04-28 21:22:08,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:08,986 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266584794]
[2025-04-28 21:22:08,986 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:08,986 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:08,994 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes.
[2025-04-28 21:22:09,007 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements.
[2025-04-28 21:22:09,008 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:09,008 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:09,426 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:22:09,426 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:09,426 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266584794]
[2025-04-28 21:22:09,426 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266584794] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:09,426 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134800129]
[2025-04-28 21:22:09,427 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:09,427 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:09,430 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:09,432 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:22:09,436 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:22:09,544 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes.
[2025-04-28 21:22:09,576 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements.
[2025-04-28 21:22:09,576 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:09,576 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:09,578 INFO  L256         TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 40 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:09,580 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:09,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:22:09,745 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:13,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:22:13,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [134800129] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:13,097 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:13,097 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 23
[2025-04-28 21:22:13,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359279367]
[2025-04-28 21:22:13,097 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:13,097 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-04-28 21:22:13,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:13,098 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-04-28 21:22:13,099 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:22:13,099 INFO  L87              Difference]: Start difference. First operand 30 states and 34 transitions. Second operand  has 23 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 23 states have internal predecessors, (27), 15 states have call successors, (16), 1 states have call predecessors, (16), 11 states have return successors, (19), 10 states have call predecessors, (19), 15 states have call successors, (19)
[2025-04-28 21:22:13,306 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:13,306 INFO  L93              Difference]: Finished difference Result 34 states and 39 transitions.
[2025-04-28 21:22:13,307 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:22:13,307 INFO  L79                 Accepts]: Start accepts. Automaton has  has 23 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 23 states have internal predecessors, (27), 15 states have call successors, (16), 1 states have call predecessors, (16), 11 states have return successors, (19), 10 states have call predecessors, (19), 15 states have call successors, (19) Word has length 31
[2025-04-28 21:22:13,308 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:13,309 INFO  L225             Difference]: With dead ends: 34
[2025-04-28 21:22:13,311 INFO  L226             Difference]: Without dead ends: 30
[2025-04-28 21:22:13,312 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702
[2025-04-28 21:22:13,313 INFO  L437           NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:13,313 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 201 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:22:13,314 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2025-04-28 21:22:13,320 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28.
[2025-04-28 21:22:13,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 7 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10)
[2025-04-28 21:22:13,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions.
[2025-04-28 21:22:13,324 INFO  L79                 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 31
[2025-04-28 21:22:13,324 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:13,324 INFO  L485      AbstractCegarLoop]: Abstraction has 28 states and 31 transitions.
[2025-04-28 21:22:13,324 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 23 states have internal predecessors, (27), 15 states have call successors, (16), 1 states have call predecessors, (16), 11 states have return successors, (19), 10 states have call predecessors, (19), 15 states have call successors, (19)
[2025-04-28 21:22:13,324 INFO  L278                IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions.
[2025-04-28 21:22:13,325 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-04-28 21:22:13,325 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:13,325 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:13,334 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:22:13,526 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:13,526 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:13,527 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:13,527 INFO  L85        PathProgramCache]: Analyzing trace with hash -1855622811, now seen corresponding path program 3 times
[2025-04-28 21:22:13,527 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:13,527 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621448462]
[2025-04-28 21:22:13,527 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:22:13,527 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:13,535 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes.
[2025-04-28 21:22:13,555 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 31 of 31 statements.
[2025-04-28 21:22:13,555 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:22:13,556 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:14,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:22:14,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:14,865 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621448462]
[2025-04-28 21:22:14,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621448462] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:14,865 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811669031]
[2025-04-28 21:22:14,865 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:22:14,865 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:14,868 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:14,870 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:22:14,875 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:22:15,002 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes.
[2025-04-28 21:22:15,039 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 31 of 31 statements.
[2025-04-28 21:22:15,039 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:22:15,039 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:15,042 INFO  L256         TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 81 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:15,048 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:15,266 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2025-04-28 21:22:15,348 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 18 treesize of output 9
[2025-04-28 21:22:15,408 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19
[2025-04-28 21:22:15,576 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:22:15,577 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:19,917 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:22:19,918 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:22:19,920 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1
[2025-04-28 21:22:21,062 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:22:21,063 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:22:21,065 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1
[2025-04-28 21:22:21,782 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:22:21,783 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1
[2025-04-28 21:22:22,126 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1
[2025-04-28 21:22:22,329 INFO  L325             Elim1Store]: treesize reduction 5, result has 16.7 percent of original size
[2025-04-28 21:22:22,330 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1
[2025-04-28 21:22:22,371 INFO  L325             Elim1Store]: treesize reduction 14, result has 6.7 percent of original size
[2025-04-28 21:22:22,371 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 1
[2025-04-28 21:22:22,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:22:22,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [811669031] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:22,412 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:22,412 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 24
[2025-04-28 21:22:22,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131416897]
[2025-04-28 21:22:22,413 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:22,413 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-04-28 21:22:22,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:22,414 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-04-28 21:22:22,415 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:22:22,415 INFO  L87              Difference]: Start difference. First operand 28 states and 31 transitions. Second operand  has 24 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 24 states have internal predecessors, (27), 15 states have call successors, (16), 1 states have call predecessors, (16), 11 states have return successors, (18), 10 states have call predecessors, (18), 15 states have call successors, (18)
[2025-04-28 21:22:22,853 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:22,853 INFO  L93              Difference]: Finished difference Result 34 states and 39 transitions.
[2025-04-28 21:22:22,855 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:22:22,856 INFO  L79                 Accepts]: Start accepts. Automaton has  has 24 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 24 states have internal predecessors, (27), 15 states have call successors, (16), 1 states have call predecessors, (16), 11 states have return successors, (18), 10 states have call predecessors, (18), 15 states have call successors, (18) Word has length 31
[2025-04-28 21:22:22,856 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:22,857 INFO  L225             Difference]: With dead ends: 34
[2025-04-28 21:22:22,857 INFO  L226             Difference]: Without dead ends: 34
[2025-04-28 21:22:22,857 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812
[2025-04-28 21:22:22,858 INFO  L437           NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:22,859 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 244 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:22:22,859 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2025-04-28 21:22:22,863 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32.
[2025-04-28 21:22:22,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 7 states have call successors, (7), 5 states have call predecessors, (7), 10 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13)
[2025-04-28 21:22:22,864 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions.
[2025-04-28 21:22:22,864 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 31
[2025-04-28 21:22:22,864 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:22,864 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 36 transitions.
[2025-04-28 21:22:22,865 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 24 states have internal predecessors, (27), 15 states have call successors, (16), 1 states have call predecessors, (16), 11 states have return successors, (18), 10 states have call predecessors, (18), 15 states have call successors, (18)
[2025-04-28 21:22:22,865 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions.
[2025-04-28 21:22:22,865 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-04-28 21:22:22,866 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:22,866 INFO  L218           NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:22,871 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-04-28 21:22:23,069 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:23,070 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:23,070 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:23,070 INFO  L85        PathProgramCache]: Analyzing trace with hash 1250039265, now seen corresponding path program 4 times
[2025-04-28 21:22:23,070 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:23,070 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264408196]
[2025-04-28 21:22:23,070 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:22:23,070 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:23,081 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes.
[2025-04-28 21:22:23,112 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:22:23,112 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:22:23,112 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
