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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:29,293 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:29,392 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b0bd3-2e49-4c1c-afdc-7f79662be3de/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:29,397 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:29,398 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:29,429 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:29,430 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:29,430 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:29,433 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:29,433 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:29,434 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:29,434 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:29,435 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:29,435 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:29,435 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:29,435 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:29,436 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:29,436 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:29,436 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:29,436 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:29,436 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:29,437 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:29,437 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:29,437 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:29,437 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:29,438 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:29,438 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:29,794 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:29,804 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:29,808 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:29,811 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:29,811 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:29,813 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b0bd3-2e49-4c1c-afdc-7f79662be3de/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-076.smt2
[2025-04-28 21:21:29,814 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:29,822 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,012 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf4b0bd3-2e49-4c1c-afdc-7f79662be3de/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-076.smt2
[2025-04-28 21:21:30,017 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:30,021 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:30,022 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:30,022 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:30,022 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:30,027 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,047 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,048 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:30,050 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:30,050 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:30,050 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:30,067 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,067 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,093 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,093 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,095 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,097 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,099 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,100 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,100 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,115 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:30,119 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:30,119 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:30,119 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:30,120 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,124 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:30,139 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:30,155 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,159 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,172 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:30,173 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:30,173 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:30,173 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Start given in one single declaration
[2025-04-28 21:21:30,173 INFO  L130     BoogieDeclarations]: Found specification of procedure Start
[2025-04-28 21:21:30,173 INFO  L138     BoogieDeclarations]: Found implementation of procedure Start
[2025-04-28 21:21:30,173 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure NT4 given in one single declaration
[2025-04-28 21:21:30,173 INFO  L130     BoogieDeclarations]: Found specification of procedure NT4
[2025-04-28 21:21:30,173 INFO  L138     BoogieDeclarations]: Found implementation of procedure NT4
[2025-04-28 21:21:30,173 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:30,173 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:30,174 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:30,222 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:30,224 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:30,320 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:30,320 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:30,340 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:30,340 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:30,341 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:30 BoogieIcfgContainer
[2025-04-28 21:21:30,341 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:30,347 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:30,347 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:30,352 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:30,352 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:30,353 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79456291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:30, skipping insertion in model container
[2025-04-28 21:21:30,354 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:30,354 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79456291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:30, skipping insertion in model container
[2025-04-28 21:21:30,354 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:30" (3/3) ...
[2025-04-28 21:21:30,356 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:30,379 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:30,384 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 4 procedures, 20 locations, 34 edges, 4 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:30,447 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:30,471 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;@2815327a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:30,471 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:30,475 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 20 states, 8 states have (on average 1.625) internal successors, (13), 10 states have internal predecessors, (13), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-04-28 21:21:30,486 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:30,486 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,487 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:30,488 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,495 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,496 INFO  L85        PathProgramCache]: Analyzing trace with hash -1364050918, now seen corresponding path program 1 times
[2025-04-28 21:21:30,505 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,506 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984692185]
[2025-04-28 21:21:30,506 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,537 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:30,555 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:30,555 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,555 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,692 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:30,693 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:30,693 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984692185]
[2025-04-28 21:21:30,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984692185] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:30,694 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:30,697 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:30,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646219769]
[2025-04-28 21:21:30,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:30,706 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:30,707 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:30,742 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:30,743 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:30,745 INFO  L87              Difference]: Start difference. First operand  has 20 states, 8 states have (on average 1.625) internal successors, (13), 10 states have internal predecessors, (13), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:30,862 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:30,862 INFO  L93              Difference]: Finished difference Result 20 states and 30 transitions.
[2025-04-28 21:21:30,868 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:30,869 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 9
[2025-04-28 21:21:30,870 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:30,881 INFO  L225             Difference]: With dead ends: 20
[2025-04-28 21:21:30,882 INFO  L226             Difference]: Without dead ends: 20
[2025-04-28 21:21:30,884 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:30,890 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:30,890 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:30,911 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2025-04-28 21:21:30,945 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2025-04-28 21:21:30,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11)
[2025-04-28 21:21:30,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions.
[2025-04-28 21:21:30,954 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 9
[2025-04-28 21:21:30,955 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:30,955 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 30 transitions.
[2025-04-28 21:21:30,955 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:30,956 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions.
[2025-04-28 21:21:30,957 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:30,957 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,957 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:30,958 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:30,958 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,958 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,958 INFO  L85        PathProgramCache]: Analyzing trace with hash -1306792616, now seen corresponding path program 1 times
[2025-04-28 21:21:30,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,959 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686464278]
[2025-04-28 21:21:30,959 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,965 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:30,973 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:30,973 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,973 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,055 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,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,055 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686464278]
[2025-04-28 21:21:31,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686464278] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:31,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:31,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:31,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96552067]
[2025-04-28 21:21:31,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,057 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:31,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,058 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:31,059 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:31,060 INFO  L87              Difference]: Start difference. First operand 20 states and 30 transitions. Second operand  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:31,110 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:31,111 INFO  L93              Difference]: Finished difference Result 22 states and 35 transitions.
[2025-04-28 21:21:31,111 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:31,112 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 9
[2025-04-28 21:21:31,112 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:31,113 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:21:31,113 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:21:31,113 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,114 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,117 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:31,118 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:21:31,125 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20.
[2025-04-28 21:21:31,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11)
[2025-04-28 21:21:31,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions.
[2025-04-28 21:21:31,128 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 9
[2025-04-28 21:21:31,129 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,129 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 30 transitions.
[2025-04-28 21:21:31,129 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:31,129 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions.
[2025-04-28 21:21:31,130 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:31,131 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,131 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:31,131 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:31,131 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,132 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,132 INFO  L85        PathProgramCache]: Analyzing trace with hash -1593084126, now seen corresponding path program 1 times
[2025-04-28 21:21:31,132 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,132 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006510774]
[2025-04-28 21:21:31,132 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,132 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,139 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:31,145 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:31,148 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,148 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,183 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,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,183 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006510774]
[2025-04-28 21:21:31,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006510774] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:31,183 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:31,183 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:31,183 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207553149]
[2025-04-28 21:21:31,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,184 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:31,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,185 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:31,185 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:31,185 INFO  L87              Difference]: Start difference. First operand 20 states and 30 transitions. Second operand  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:31,246 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:31,246 INFO  L93              Difference]: Finished difference Result 22 states and 35 transitions.
[2025-04-28 21:21:31,246 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:31,247 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 9
[2025-04-28 21:21:31,248 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:31,248 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:21:31,251 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:21:31,252 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,252 INFO  L437           NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,253 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:31,254 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:21:31,257 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20.
[2025-04-28 21:21:31,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11)
[2025-04-28 21:21:31,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions.
[2025-04-28 21:21:31,263 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 9
[2025-04-28 21:21:31,264 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,264 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 30 transitions.
[2025-04-28 21:21:31,264 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:31,264 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions.
[2025-04-28 21:21:31,265 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:31,265 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,266 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:31,266 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:31,266 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,267 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,267 INFO  L85        PathProgramCache]: Analyzing trace with hash -1478567522, now seen corresponding path program 1 times
[2025-04-28 21:21:31,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,271 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634108729]
[2025-04-28 21:21:31,272 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,278 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:31,280 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:31,284 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,284 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,331 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,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,331 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634108729]
[2025-04-28 21:21:31,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634108729] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:31,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:31,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:31,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972719370]
[2025-04-28 21:21:31,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,332 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:31,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,332 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:31,332 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:31,333 INFO  L87              Difference]: Start difference. First operand 20 states and 30 transitions. Second operand  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:31,387 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:31,387 INFO  L93              Difference]: Finished difference Result 24 states and 40 transitions.
[2025-04-28 21:21:31,389 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:31,389 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 9
[2025-04-28 21:21:31,390 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:31,391 INFO  L225             Difference]: With dead ends: 24
[2025-04-28 21:21:31,391 INFO  L226             Difference]: Without dead ends: 24
[2025-04-28 21:21:31,391 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,392 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,392 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:31,393 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2025-04-28 21:21:31,396 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20.
[2025-04-28 21:21:31,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11)
[2025-04-28 21:21:31,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions.
[2025-04-28 21:21:31,398 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 9
[2025-04-28 21:21:31,398 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,398 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 30 transitions.
[2025-04-28 21:21:31,398 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:31,398 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions.
[2025-04-28 21:21:31,399 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:31,399 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,399 INFO  L218           NwaCegarLoop]: trace histogram [5, 4, 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:31,399 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:31,400 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,400 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,400 INFO  L85        PathProgramCache]: Analyzing trace with hash 1093207287, now seen corresponding path program 1 times
[2025-04-28 21:21:31,400 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,400 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167351043]
[2025-04-28 21:21:31,400 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,406 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:31,446 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:31,446 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,446 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:21:31,771 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,771 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167351043]
[2025-04-28 21:21:31,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167351043] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:31,771 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128429568]
[2025-04-28 21:21:31,771 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,771 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:31,774 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:31,780 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:31,781 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:31,815 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:31,827 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:31,827 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,827 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,829 INFO  L256         TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:31,841 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:32,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-04-28 21:21:32,207 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:33,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-04-28 21:21:33,143 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128429568] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:33,144 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:33,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 16
[2025-04-28 21:21:33,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853091130]
[2025-04-28 21:21:33,144 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,144 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-04-28 21:21:33,144 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,145 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-04-28 21:21:33,145 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:33,146 INFO  L87              Difference]: Start difference. First operand 20 states and 30 transitions. Second operand  has 16 states, 5 states have (on average 3.6) internal successors, (18), 12 states have internal predecessors, (18), 12 states have call successors, (17), 1 states have call predecessors, (17), 5 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17)
[2025-04-28 21:21:33,873 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,874 INFO  L93              Difference]: Finished difference Result 55 states and 139 transitions.
[2025-04-28 21:21:33,874 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-04-28 21:21:33,875 INFO  L79                 Accepts]: Start accepts. Automaton has  has 16 states, 5 states have (on average 3.6) internal successors, (18), 12 states have internal predecessors, (18), 12 states have call successors, (17), 1 states have call predecessors, (17), 5 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17) Word has length 29
[2025-04-28 21:21:33,875 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,879 INFO  L225             Difference]: With dead ends: 55
[2025-04-28 21:21:33,879 INFO  L226             Difference]: Without dead ends: 51
[2025-04-28 21:21:33,880 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:21:33,882 INFO  L437           NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,882 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 113 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:21:33,885 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2025-04-28 21:21:33,904 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38.
[2025-04-28 21:21:33,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 15 states have internal predecessors, (21), 16 states have call successors, (16), 4 states have call predecessors, (16), 8 states have return successors, (46), 18 states have call predecessors, (46), 16 states have call successors, (46)
[2025-04-28 21:21:33,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 83 transitions.
[2025-04-28 21:21:33,906 INFO  L79                 Accepts]: Start accepts. Automaton has 38 states and 83 transitions. Word has length 29
[2025-04-28 21:21:33,906 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,907 INFO  L485      AbstractCegarLoop]: Abstraction has 38 states and 83 transitions.
[2025-04-28 21:21:33,907 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 5 states have (on average 3.6) internal successors, (18), 12 states have internal predecessors, (18), 12 states have call successors, (17), 1 states have call predecessors, (17), 5 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17)
[2025-04-28 21:21:33,907 INFO  L278                IsEmpty]: Start isEmpty. Operand 38 states and 83 transitions.
[2025-04-28 21:21:33,909 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:33,909 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,909 INFO  L218           NwaCegarLoop]: trace histogram [5, 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:33,915 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:34,110 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:34,110 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,111 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,111 INFO  L85        PathProgramCache]: Analyzing trace with hash 283860661, now seen corresponding path program 1 times
[2025-04-28 21:21:34,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,111 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826801894]
[2025-04-28 21:21:34,111 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,116 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:34,122 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:34,122 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,122 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:21:34,318 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,318 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826801894]
[2025-04-28 21:21:34,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826801894] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:34,318 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466023091]
[2025-04-28 21:21:34,318 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,318 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:34,321 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:34,323 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:34,327 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:34,359 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:34,371 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:34,371 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,372 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,372 INFO  L256         TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:34,374 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:34,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:34,566 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:35,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:35,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466023091] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:35,355 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:35,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 17
[2025-04-28 21:21:35,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028126919]
[2025-04-28 21:21:35,356 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:35,356 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:35,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:35,357 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:35,357 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:35,357 INFO  L87              Difference]: Start difference. First operand 38 states and 83 transitions. Second operand  has 17 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 13 states have internal predecessors, (20), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17)
[2025-04-28 21:21:36,325 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,326 INFO  L93              Difference]: Finished difference Result 73 states and 230 transitions.
[2025-04-28 21:21:36,326 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-04-28 21:21:36,326 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 13 states have internal predecessors, (20), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17) Word has length 29
[2025-04-28 21:21:36,327 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,333 INFO  L225             Difference]: With dead ends: 73
[2025-04-28 21:21:36,333 INFO  L226             Difference]: Without dead ends: 67
[2025-04-28 21:21:36,334 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=991, Unknown=0, NotChecked=0, Total=1260
[2025-04-28 21:21:36,336 INFO  L437           NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,336 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 96 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:36,337 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2025-04-28 21:21:36,374 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44.
[2025-04-28 21:21:36,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 18 states have internal predecessors, (23), 18 states have call successors, (18), 4 states have call predecessors, (18), 10 states have return successors, (70), 21 states have call predecessors, (70), 18 states have call successors, (70)
[2025-04-28 21:21:36,379 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 111 transitions.
[2025-04-28 21:21:36,379 INFO  L79                 Accepts]: Start accepts. Automaton has 44 states and 111 transitions. Word has length 29
[2025-04-28 21:21:36,380 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,380 INFO  L485      AbstractCegarLoop]: Abstraction has 44 states and 111 transitions.
[2025-04-28 21:21:36,380 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 13 states have internal predecessors, (20), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17)
[2025-04-28 21:21:36,380 INFO  L278                IsEmpty]: Start isEmpty. Operand 44 states and 111 transitions.
[2025-04-28 21:21:36,387 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:36,387 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,387 INFO  L218           NwaCegarLoop]: trace histogram [5, 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:21:36,395 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:36,588 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:36,588 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,589 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,589 INFO  L85        PathProgramCache]: Analyzing trace with hash 571680519, now seen corresponding path program 1 times
[2025-04-28 21:21:36,589 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,589 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204375666]
[2025-04-28 21:21:36,589 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,593 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:36,600 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:36,601 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,601 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,730 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:21:36,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,731 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204375666]
[2025-04-28 21:21:36,731 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204375666] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:36,731 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161636525]
[2025-04-28 21:21:36,731 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,731 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:36,734 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:36,736 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:36,744 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:36,777 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:36,785 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:36,785 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,785 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,786 INFO  L256         TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:36,788 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:36,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:36,962 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:37,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:37,627 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161636525] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:37,627 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:37,627 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 17
[2025-04-28 21:21:37,627 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104112093]
[2025-04-28 21:21:37,628 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,628 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:37,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,628 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:37,629 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:37,629 INFO  L87              Difference]: Start difference. First operand 44 states and 111 transitions. Second operand  has 17 states, 6 states have (on average 3.5) internal successors, (21), 13 states have internal predecessors, (21), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17)
[2025-04-28 21:21:38,317 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:38,317 INFO  L93              Difference]: Finished difference Result 113 states and 582 transitions.
[2025-04-28 21:21:38,318 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-04-28 21:21:38,318 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 6 states have (on average 3.5) internal successors, (21), 13 states have internal predecessors, (21), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17) Word has length 29
[2025-04-28 21:21:38,318 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:38,326 INFO  L225             Difference]: With dead ends: 113
[2025-04-28 21:21:38,327 INFO  L226             Difference]: Without dead ends: 113
[2025-04-28 21:21:38,328 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702
[2025-04-28 21:21:38,329 INFO  L437           NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:38,331 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 178 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:38,331 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2025-04-28 21:21:38,394 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69.
[2025-04-28 21:21:38,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 69 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 27 states have internal predecessors, (31), 27 states have call successors, (27), 4 states have call predecessors, (27), 18 states have return successors, (202), 37 states have call predecessors, (202), 27 states have call successors, (202)
[2025-04-28 21:21:38,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 260 transitions.
[2025-04-28 21:21:38,397 INFO  L79                 Accepts]: Start accepts. Automaton has 69 states and 260 transitions. Word has length 29
[2025-04-28 21:21:38,398 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,398 INFO  L485      AbstractCegarLoop]: Abstraction has 69 states and 260 transitions.
[2025-04-28 21:21:38,398 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 6 states have (on average 3.5) internal successors, (21), 13 states have internal predecessors, (21), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17)
[2025-04-28 21:21:38,398 INFO  L278                IsEmpty]: Start isEmpty. Operand 69 states and 260 transitions.
[2025-04-28 21:21:38,402 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:38,402 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,402 INFO  L218           NwaCegarLoop]: trace histogram [5, 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:38,407 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:38,603 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:38,603 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,603 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,604 INFO  L85        PathProgramCache]: Analyzing trace with hash -1583066757, now seen corresponding path program 1 times
[2025-04-28 21:21:38,604 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,604 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404399976]
[2025-04-28 21:21:38,604 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,604 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,607 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:38,611 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:38,611 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,611 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:21:38,745 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:38,745 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404399976]
[2025-04-28 21:21:38,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404399976] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:38,745 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903161118]
[2025-04-28 21:21:38,745 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,745 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:38,748 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:38,750 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:38,753 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:38,791 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:38,799 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:38,799 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,799 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,800 INFO  L256         TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:38,801 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:38,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:38,933 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:39,558 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:39,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903161118] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:39,562 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:39,562 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 17
[2025-04-28 21:21:39,562 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820252308]
[2025-04-28 21:21:39,562 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,563 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:39,563 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,564 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:39,565 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:39,565 INFO  L87              Difference]: Start difference. First operand 69 states and 260 transitions. Second operand  has 17 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 13 states have internal predecessors, (20), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17)
[2025-04-28 21:21:40,282 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,282 INFO  L93              Difference]: Finished difference Result 142 states and 901 transitions.
[2025-04-28 21:21:40,283 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-04-28 21:21:40,283 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 13 states have internal predecessors, (20), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17) Word has length 29
[2025-04-28 21:21:40,283 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,290 INFO  L225             Difference]: With dead ends: 142
[2025-04-28 21:21:40,290 INFO  L226             Difference]: Without dead ends: 136
[2025-04-28 21:21:40,291 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=991, Unknown=0, NotChecked=0, Total=1260
[2025-04-28 21:21:40,292 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,292 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 132 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:21:40,293 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2025-04-28 21:21:40,379 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 67.
[2025-04-28 21:21:40,382 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 67 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 25 states have internal predecessors, (30), 27 states have call successors, (27), 4 states have call predecessors, (27), 17 states have return successors, (184), 37 states have call predecessors, (184), 27 states have call successors, (184)
[2025-04-28 21:21:40,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 241 transitions.
[2025-04-28 21:21:40,388 INFO  L79                 Accepts]: Start accepts. Automaton has 67 states and 241 transitions. Word has length 29
[2025-04-28 21:21:40,389 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,389 INFO  L485      AbstractCegarLoop]: Abstraction has 67 states and 241 transitions.
[2025-04-28 21:21:40,389 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 13 states have internal predecessors, (20), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17)
[2025-04-28 21:21:40,389 INFO  L278                IsEmpty]: Start isEmpty. Operand 67 states and 241 transitions.
[2025-04-28 21:21:40,391 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:40,394 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,395 INFO  L218           NwaCegarLoop]: trace histogram [5, 2, 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:40,400 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:40,595 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:40,595 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,596 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -1958518211, now seen corresponding path program 1 times
[2025-04-28 21:21:40,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,596 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107117050]
[2025-04-28 21:21:40,596 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,600 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:40,605 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:40,605 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,605 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,736 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:40,736 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,736 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107117050]
[2025-04-28 21:21:40,736 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107117050] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:40,736 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115484147]
[2025-04-28 21:21:40,736 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,736 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:40,739 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:40,742 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:40,748 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:40,787 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:40,794 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:40,794 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,794 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,794 INFO  L256         TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:40,796 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:40,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-04-28 21:21:40,933 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:41,481 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-04-28 21:21:41,482 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [115484147] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:41,482 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:41,482 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 19
[2025-04-28 21:21:41,482 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881749153]
[2025-04-28 21:21:41,482 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:41,482 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-04-28 21:21:41,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:41,483 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-04-28 21:21:41,483 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:41,483 INFO  L87              Difference]: Start difference. First operand 67 states and 241 transitions. Second operand  has 19 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 15 states have internal predecessors, (24), 14 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17)
[2025-04-28 21:21:42,351 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:42,351 INFO  L93              Difference]: Finished difference Result 179 states and 1351 transitions.
[2025-04-28 21:21:42,351 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-04-28 21:21:42,351 INFO  L79                 Accepts]: Start accepts. Automaton has  has 19 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 15 states have internal predecessors, (24), 14 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17) Word has length 29
[2025-04-28 21:21:42,352 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:42,363 INFO  L225             Difference]: With dead ends: 179
[2025-04-28 21:21:42,363 INFO  L226             Difference]: Without dead ends: 171
[2025-04-28 21:21:42,363 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870
[2025-04-28 21:21:42,364 INFO  L437           NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:42,364 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 264 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:42,365 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2025-04-28 21:21:42,471 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 100.
[2025-04-28 21:21:42,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 49 states have call successors, (49), 5 states have call predecessors, (49), 22 states have return successors, (392), 63 states have call predecessors, (392), 49 states have call successors, (392)
[2025-04-28 21:21:42,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 480 transitions.
[2025-04-28 21:21:42,481 INFO  L79                 Accepts]: Start accepts. Automaton has 100 states and 480 transitions. Word has length 29
[2025-04-28 21:21:42,481 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:42,481 INFO  L485      AbstractCegarLoop]: Abstraction has 100 states and 480 transitions.
[2025-04-28 21:21:42,481 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 15 states have internal predecessors, (24), 14 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17)
[2025-04-28 21:21:42,481 INFO  L278                IsEmpty]: Start isEmpty. Operand 100 states and 480 transitions.
[2025-04-28 21:21:42,484 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:42,484 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:42,485 INFO  L218           NwaCegarLoop]: trace histogram [5, 2, 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:42,495 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:42,685 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:42,685 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:42,686 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:42,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -2092531717, now seen corresponding path program 2 times
[2025-04-28 21:21:42,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:42,686 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200536367]
[2025-04-28 21:21:42,686 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:42,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:42,690 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes.
[2025-04-28 21:21:42,695 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:42,695 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:42,695 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:42,812 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:42,812 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:42,812 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200536367]
[2025-04-28 21:21:42,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200536367] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:42,812 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117877164]
[2025-04-28 21:21:42,812 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:42,813 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:42,815 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:42,817 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:42,821 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:42,870 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes.
[2025-04-28 21:21:42,879 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:42,879 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:42,879 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:42,880 INFO  L256         TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:42,881 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:43,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:43,025 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:43,580 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:43,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117877164] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:43,581 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:43,581 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 20
[2025-04-28 21:21:43,581 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608923240]
[2025-04-28 21:21:43,581 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:43,581 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-04-28 21:21:43,581 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:43,582 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-04-28 21:21:43,582 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:21:43,582 INFO  L87              Difference]: Start difference. First operand 100 states and 480 transitions. Second operand  has 20 states, 8 states have (on average 3.25) internal successors, (26), 16 states have internal predecessors, (26), 14 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17)
[2025-04-28 21:21:44,538 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:44,538 INFO  L93              Difference]: Finished difference Result 228 states and 2431 transitions.
[2025-04-28 21:21:44,539 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-04-28 21:21:44,539 INFO  L79                 Accepts]: Start accepts. Automaton has  has 20 states, 8 states have (on average 3.25) internal successors, (26), 16 states have internal predecessors, (26), 14 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17) Word has length 29
[2025-04-28 21:21:44,539 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:44,565 INFO  L225             Difference]: With dead ends: 228
[2025-04-28 21:21:44,565 INFO  L226             Difference]: Without dead ends: 222
[2025-04-28 21:21:44,566 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056
[2025-04-28 21:21:44,567 INFO  L437           NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:44,569 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 245 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:44,570 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 222 states.
[2025-04-28 21:21:44,795 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 114.
[2025-04-28 21:21:44,796 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114 states, 32 states have (on average 1.34375) internal successors, (43), 36 states have internal predecessors, (43), 55 states have call successors, (55), 5 states have call predecessors, (55), 26 states have return successors, (530), 72 states have call predecessors, (530), 55 states have call successors, (530)
[2025-04-28 21:21:44,802 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 628 transitions.
[2025-04-28 21:21:44,803 INFO  L79                 Accepts]: Start accepts. Automaton has 114 states and 628 transitions. Word has length 29
[2025-04-28 21:21:44,803 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:44,803 INFO  L485      AbstractCegarLoop]: Abstraction has 114 states and 628 transitions.
[2025-04-28 21:21:44,803 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 8 states have (on average 3.25) internal successors, (26), 16 states have internal predecessors, (26), 14 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17)
[2025-04-28 21:21:44,804 INFO  L278                IsEmpty]: Start isEmpty. Operand 114 states and 628 transitions.
[2025-04-28 21:21:44,809 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:44,809 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:44,809 INFO  L218           NwaCegarLoop]: trace histogram [5, 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:44,815 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-04-28 21:21:45,013 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:45,014 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:45,015 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:45,015 INFO  L85        PathProgramCache]: Analyzing trace with hash -1690491199, now seen corresponding path program 1 times
[2025-04-28 21:21:45,015 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:45,015 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761015591]
[2025-04-28 21:21:45,015 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:45,016 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:45,021 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:45,023 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:45,023 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:45,024 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:45,131 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:45,131 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761015591]
[2025-04-28 21:21:45,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761015591] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:45,131 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911731749]
[2025-04-28 21:21:45,131 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:45,131 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:45,133 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:45,135 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:45,138 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:45,193 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:45,200 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:45,200 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:45,200 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,201 INFO  L256         TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:45,202 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:45,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:45,362 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:45,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:45,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [911731749] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:45,966 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:45,967 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 20
[2025-04-28 21:21:45,967 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311285899]
[2025-04-28 21:21:45,967 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:45,967 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-04-28 21:21:45,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:45,968 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-04-28 21:21:45,968 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:21:45,968 INFO  L87              Difference]: Start difference. First operand 114 states and 628 transitions. Second operand  has 20 states, 8 states have (on average 3.25) internal successors, (26), 16 states have internal predecessors, (26), 14 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17)
[2025-04-28 21:21:46,896 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:46,896 INFO  L93              Difference]: Finished difference Result 238 states and 2657 transitions.
[2025-04-28 21:21:46,897 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-04-28 21:21:46,897 INFO  L79                 Accepts]: Start accepts. Automaton has  has 20 states, 8 states have (on average 3.25) internal successors, (26), 16 states have internal predecessors, (26), 14 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17) Word has length 29
[2025-04-28 21:21:46,897 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:46,919 INFO  L225             Difference]: With dead ends: 238
[2025-04-28 21:21:46,919 INFO  L226             Difference]: Without dead ends: 232
[2025-04-28 21:21:46,920 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056
[2025-04-28 21:21:46,920 INFO  L437           NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:46,921 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 197 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:46,921 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 232 states.
[2025-04-28 21:21:47,099 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 112.
[2025-04-28 21:21:47,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 112 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 34 states have internal predecessors, (42), 55 states have call successors, (55), 5 states have call predecessors, (55), 25 states have return successors, (506), 72 states have call predecessors, (506), 55 states have call successors, (506)
[2025-04-28 21:21:47,104 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 603 transitions.
[2025-04-28 21:21:47,104 INFO  L79                 Accepts]: Start accepts. Automaton has 112 states and 603 transitions. Word has length 29
[2025-04-28 21:21:47,104 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:47,104 INFO  L485      AbstractCegarLoop]: Abstraction has 112 states and 603 transitions.
[2025-04-28 21:21:47,104 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 8 states have (on average 3.25) internal successors, (26), 16 states have internal predecessors, (26), 14 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17)
[2025-04-28 21:21:47,105 INFO  L278                IsEmpty]: Start isEmpty. Operand 112 states and 603 transitions.
[2025-04-28 21:21:47,109 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:47,109 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:47,109 INFO  L218           NwaCegarLoop]: trace histogram [5, 2, 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:47,114 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-04-28 21:21:47,312 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2025-04-28 21:21:47,313 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:47,313 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:47,314 INFO  L85        PathProgramCache]: Analyzing trace with hash -364883395, now seen corresponding path program 3 times
[2025-04-28 21:21:47,314 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:47,314 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215169706]
[2025-04-28 21:21:47,314 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:47,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:47,324 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes.
[2025-04-28 21:21:47,326 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 29 statements.
[2025-04-28 21:21:47,327 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:47,327 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:47,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:47,434 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215169706]
[2025-04-28 21:21:47,434 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215169706] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:47,435 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382136670]
[2025-04-28 21:21:47,435 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:47,435 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:47,437 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:47,439 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:47,442 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:47,498 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes.
[2025-04-28 21:21:47,505 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 29 statements.
[2025-04-28 21:21:47,505 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:47,506 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,506 INFO  L256         TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:47,508 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:47,576 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:47,576 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:47,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:47,979 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [382136670] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:47,979 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:47,979 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13
[2025-04-28 21:21:47,979 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667975532]
[2025-04-28 21:21:47,979 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:47,980 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:47,980 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:47,980 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:47,980 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:47,981 INFO  L87              Difference]: Start difference. First operand 112 states and 603 transitions. Second operand  has 13 states, 5 states have (on average 3.4) internal successors, (17), 10 states have internal predecessors, (17), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14)
[2025-04-28 21:21:48,372 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:48,372 INFO  L93              Difference]: Finished difference Result 238 states and 2368 transitions.
[2025-04-28 21:21:48,372 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:48,373 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 5 states have (on average 3.4) internal successors, (17), 10 states have internal predecessors, (17), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) Word has length 29
[2025-04-28 21:21:48,373 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:48,390 INFO  L225             Difference]: With dead ends: 238
[2025-04-28 21:21:48,390 INFO  L226             Difference]: Without dead ends: 234
[2025-04-28 21:21:48,390 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:48,391 INFO  L437           NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:48,391 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 151 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:48,392 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 234 states.
[2025-04-28 21:21:48,545 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 149.
[2025-04-28 21:21:48,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 149 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 78 states have call successors, (78), 5 states have call predecessors, (78), 32 states have return successors, (980), 102 states have call predecessors, (980), 78 states have call successors, (980)
[2025-04-28 21:21:48,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 1107 transitions.
[2025-04-28 21:21:48,554 INFO  L79                 Accepts]: Start accepts. Automaton has 149 states and 1107 transitions. Word has length 29
[2025-04-28 21:21:48,554 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:48,555 INFO  L485      AbstractCegarLoop]: Abstraction has 149 states and 1107 transitions.
[2025-04-28 21:21:48,555 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 5 states have (on average 3.4) internal successors, (17), 10 states have internal predecessors, (17), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14)
[2025-04-28 21:21:48,555 INFO  L278                IsEmpty]: Start isEmpty. Operand 149 states and 1107 transitions.
[2025-04-28 21:21:48,561 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:48,562 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:48,562 INFO  L218           NwaCegarLoop]: trace histogram [5, 2, 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:48,567 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:48,765 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-04-28 21:21:48,766 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:48,766 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:48,766 INFO  L85        PathProgramCache]: Analyzing trace with hash -1174230021, now seen corresponding path program 4 times
[2025-04-28 21:21:48,766 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:48,766 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905627046]
[2025-04-28 21:21:48,767 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:48,767 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:48,770 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes.
[2025-04-28 21:21:48,773 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:48,773 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-04-28 21:21:48,773 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:48,871 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:48,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:48,872 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905627046]
[2025-04-28 21:21:48,872 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905627046] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:48,872 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429996536]
[2025-04-28 21:21:48,872 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:48,872 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:48,874 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:48,876 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:48,880 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:21:48,936 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes.
[2025-04-28 21:21:48,944 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:48,945 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-04-28 21:21:48,945 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:48,945 INFO  L256         TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:48,947 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:49,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:49,134 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:49,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:49,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [429996536] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:49,735 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:49,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 21
[2025-04-28 21:21:49,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504843702]
[2025-04-28 21:21:49,735 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:49,735 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-04-28 21:21:49,735 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:49,736 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-04-28 21:21:49,736 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420
[2025-04-28 21:21:49,737 INFO  L87              Difference]: Start difference. First operand 149 states and 1107 transitions. Second operand  has 21 states, 9 states have (on average 3.0) internal successors, (27), 17 states have internal predecessors, (27), 14 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17)
[2025-04-28 21:21:50,707 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:50,707 INFO  L93              Difference]: Finished difference Result 384 states and 7224 transitions.
[2025-04-28 21:21:50,708 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2025-04-28 21:21:50,708 INFO  L79                 Accepts]: Start accepts. Automaton has  has 21 states, 9 states have (on average 3.0) internal successors, (27), 17 states have internal predecessors, (27), 14 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17) Word has length 29
[2025-04-28 21:21:50,708 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:50,787 INFO  L225             Difference]: With dead ends: 384
[2025-04-28 21:21:50,787 INFO  L226             Difference]: Without dead ends: 367
[2025-04-28 21:21:50,787 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190
[2025-04-28 21:21:50,788 INFO  L437           NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:50,789 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 205 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:50,790 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 367 states.
[2025-04-28 21:21:51,440 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 241.
[2025-04-28 21:21:51,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 241 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 64 states have internal predecessors, (71), 126 states have call successors, (126), 5 states have call predecessors, (126), 54 states have return successors, (2839), 171 states have call predecessors, (2839), 126 states have call successors, (2839)
[2025-04-28 21:21:51,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 3036 transitions.
[2025-04-28 21:21:51,465 INFO  L79                 Accepts]: Start accepts. Automaton has 241 states and 3036 transitions. Word has length 29
[2025-04-28 21:21:51,466 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,466 INFO  L485      AbstractCegarLoop]: Abstraction has 241 states and 3036 transitions.
[2025-04-28 21:21:51,466 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 9 states have (on average 3.0) internal successors, (27), 17 states have internal predecessors, (27), 14 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17)
[2025-04-28 21:21:51,466 INFO  L278                IsEmpty]: Start isEmpty. Operand 241 states and 3036 transitions.
[2025-04-28 21:21:51,477 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:51,477 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,477 INFO  L218           NwaCegarLoop]: trace histogram [5, 2, 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:51,482 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:51,680 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-04-28 21:21:51,681 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,681 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,682 INFO  L85        PathProgramCache]: Analyzing trace with hash 242692607, now seen corresponding path program 1 times
[2025-04-28 21:21:51,682 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,682 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306799758]
[2025-04-28 21:21:51,682 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,685 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:51,687 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:51,687 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,687 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:51,775 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,775 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306799758]
[2025-04-28 21:21:51,775 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306799758] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:51,775 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456586497]
[2025-04-28 21:21:51,775 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,775 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:51,777 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:51,779 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:51,783 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-04-28 21:21:51,844 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:51,851 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:51,852 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,852 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,852 INFO  L256         TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:51,854 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:52,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:52,006 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:52,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:52,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456586497] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:52,586 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:52,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 20
[2025-04-28 21:21:52,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108842368]
[2025-04-28 21:21:52,587 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:52,587 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-04-28 21:21:52,587 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:52,588 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-04-28 21:21:52,588 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:21:52,588 INFO  L87              Difference]: Start difference. First operand 241 states and 3036 transitions. Second operand  has 20 states, 8 states have (on average 3.125) internal successors, (25), 16 states have internal predecessors, (25), 13 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18)
[2025-04-28 21:21:53,597 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:53,597 INFO  L93              Difference]: Finished difference Result 1069 states and 30620 transitions.
[2025-04-28 21:21:53,598 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-04-28 21:21:53,598 INFO  L79                 Accepts]: Start accepts. Automaton has  has 20 states, 8 states have (on average 3.125) internal successors, (25), 16 states have internal predecessors, (25), 13 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) Word has length 29
[2025-04-28 21:21:53,598 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:53,842 INFO  L225             Difference]: With dead ends: 1069
[2025-04-28 21:21:53,842 INFO  L226             Difference]: Without dead ends: 1025
[2025-04-28 21:21:53,842 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=1074, Unknown=0, NotChecked=0, Total=1332
[2025-04-28 21:21:53,843 INFO  L437           NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:53,843 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 216 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:53,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1025 states.
[2025-04-28 21:21:59,174 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 461.
[2025-04-28 21:21:59,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 461 states, 103 states have (on average 1.1650485436893203) internal successors, (120), 107 states have internal predecessors, (120), 262 states have call successors, (262), 7 states have call predecessors, (262), 95 states have return successors, (8859), 346 states have call predecessors, (8859), 262 states have call successors, (8859)
[2025-04-28 21:21:59,259 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 9241 transitions.
[2025-04-28 21:21:59,260 INFO  L79                 Accepts]: Start accepts. Automaton has 461 states and 9241 transitions. Word has length 29
[2025-04-28 21:21:59,261 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:59,261 INFO  L485      AbstractCegarLoop]: Abstraction has 461 states and 9241 transitions.
[2025-04-28 21:21:59,262 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 8 states have (on average 3.125) internal successors, (25), 16 states have internal predecessors, (25), 13 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18)
[2025-04-28 21:21:59,262 INFO  L278                IsEmpty]: Start isEmpty. Operand 461 states and 9241 transitions.
[2025-04-28 21:21:59,292 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2025-04-28 21:21:59,292 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:59,293 INFO  L218           NwaCegarLoop]: trace histogram [9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:59,298 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2025-04-28 21:21:59,496 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:59,497 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:59,498 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:59,498 INFO  L85        PathProgramCache]: Analyzing trace with hash -1242328858, now seen corresponding path program 5 times
[2025-04-28 21:21:59,498 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:59,498 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988537892]
[2025-04-28 21:21:59,498 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:59,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:59,503 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 6 equivalence classes.
[2025-04-28 21:21:59,513 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 49 of 49 statements.
[2025-04-28 21:21:59,514 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s)
[2025-04-28 21:21:59,514 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:59,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked.
[2025-04-28 21:21:59,736 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:59,736 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988537892]
[2025-04-28 21:21:59,736 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988537892] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:59,736 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178935807]
[2025-04-28 21:21:59,736 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:59,736 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:59,738 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:59,740 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:59,744 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-04-28 21:21:59,811 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 6 equivalence classes.
[2025-04-28 21:21:59,832 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 49 of 49 statements.
[2025-04-28 21:21:59,832 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s)
[2025-04-28 21:21:59,832 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:59,833 INFO  L256         TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:59,834 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:59,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked.
[2025-04-28 21:21:59,924 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
