./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/ultimate/Lia-NonLinArrays/42_FreeBSD_rdma_addr_sliced_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:25:29,366 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:25:29,416 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2177a7d2-4cb6-4b2d-9423-a97e962728ef/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:25:29,419 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:25:29,420 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:25:29,437 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:25:29,438 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:25:29,438 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:25:29,438 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:25:29,438 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:25:29,439 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:25:29,439 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:25:29,439 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:25:29,439 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:25:29,439 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:25:29,439 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:25:29,439 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:25:29,439 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:25:29,439 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:25:29,439 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:25:29,440 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:25:29,440 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:25:29,440 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:25:29,440 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:25:29,440 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:25:29,441 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:25:29,441 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:25:29,628 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:25:29,635 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:25:29,638 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:25:29,639 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:25:29,639 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:25:29,640 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2177a7d2-4cb6-4b2d-9423-a97e962728ef/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/ultimate/Lia-NonLinArrays/42_FreeBSD_rdma_addr_sliced_000.smt2
[2025-05-07 17:25:29,641 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:25:29,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:25:30,138 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2177a7d2-4cb6-4b2d-9423-a97e962728ef/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/ultimate/Lia-NonLinArrays/42_FreeBSD_rdma_addr_sliced_000.smt2
[2025-05-07 17:25:30,140 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:25:30,141 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:25:30,142 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:25:30,142 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:25:30,142 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:25:30,143 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,171 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30 Unit
[2025-05-07 17:25:30,172 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:25:30,172 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:25:30,172 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:25:30,172 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:25:30,182 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,183 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,202 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,202 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,216 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,219 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,222 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,225 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,227 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,240 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:25:30,240 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:25:30,240 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:25:30,240 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:25:30,241 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,243 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:25:30,251 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:30,260 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:25:30,263 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:25:30,272 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:25:30,273 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:25:30,273 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:25:30,273 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure CHC_COMP_FALSE given in one single declaration
[2025-05-07 17:25:30,273 INFO  L130     BoogieDeclarations]: Found specification of procedure CHC_COMP_FALSE
[2025-05-07 17:25:30,273 INFO  L138     BoogieDeclarations]: Found implementation of procedure CHC_COMP_FALSE
[2025-05-07 17:25:30,273 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Inv given in one single declaration
[2025-05-07 17:25:30,273 INFO  L130     BoogieDeclarations]: Found specification of procedure Inv
[2025-05-07 17:25:30,273 INFO  L138     BoogieDeclarations]: Found implementation of procedure Inv
[2025-05-07 17:25:30,273 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:25:30,273 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:25:30,273 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:25:30,324 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:25:30,326 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:25:31,135 INFO  L?                        ?]: Removed 41 outVars from TransFormulas that were not future-live.
[2025-05-07 17:25:31,135 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:25:31,151 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:25:31,151 INFO  L312             CfgBuilder]: Removed 2 assume(true) statements.
[2025-05-07 17:25:31,152 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:25:31 BoogieIcfgContainer
[2025-05-07 17:25:31,152 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:25:31,154 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:25:31,154 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:25:31,157 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:25:31,157 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:25:30" (1/3) ...
[2025-05-07 17:25:31,158 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3873f1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:25:31, skipping insertion in model container
[2025-05-07 17:25:31,158 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (2/3) ...
[2025-05-07 17:25:31,158 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3873f1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:25:31, skipping insertion in model container
[2025-05-07 17:25:31,158 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:25:31" (3/3) ...
[2025-05-07 17:25:31,159 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:25:31,169 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:25:31,172 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 4 procedures, 224 locations, 815 edges, 4 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:25:31,210 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:25:31,219 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;@205b275, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:25:31,220 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:25:31,223 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 224 states, 8 states have (on average 22.0) internal successors, (176), 176 states have internal predecessors, (176), 213 states have call successors, (213), 3 states have call predecessors, (213), 3 states have return successors, (213), 46 states have call predecessors, (213), 213 states have call successors, (213)
[2025-05-07 17:25:31,352 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2025-05-07 17:25:31,352 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:31,353 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2025-05-07 17:25:31,353 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:31,357 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:31,357 INFO  L85        PathProgramCache]: Analyzing trace with hash 1264163934, now seen corresponding path program 1 times
[2025-05-07 17:25:31,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:31,362 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686552074]
[2025-05-07 17:25:31,363 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:31,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:31,379 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-05-07 17:25:31,381 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-05-07 17:25:31,381 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:31,381 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:31,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:31,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:31,402 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686552074]
[2025-05-07 17:25:31,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686552074] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:31,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:31,405 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-05-07 17:25:31,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137721086]
[2025-05-07 17:25:31,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:31,409 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-05-07 17:25:31,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:31,427 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-05-07 17:25:31,427 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-05-07 17:25:31,429 INFO  L87              Difference]: Start difference. First operand  has 224 states, 8 states have (on average 22.0) internal successors, (176), 176 states have internal predecessors, (176), 213 states have call successors, (213), 3 states have call predecessors, (213), 3 states have return successors, (213), 46 states have call predecessors, (213), 213 states have call successors, (213) Second operand  has 2 states, 2 states have (on average 1.5) internal successors, (3), 1 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2025-05-07 17:25:31,511 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:31,511 INFO  L93              Difference]: Finished difference Result 222 states and 599 transitions.
[2025-05-07 17:25:31,512 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-05-07 17:25:31,513 INFO  L79                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 1.5) internal successors, (3), 1 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5
[2025-05-07 17:25:31,514 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:31,566 INFO  L225             Difference]: With dead ends: 222
[2025-05-07 17:25:31,567 INFO  L226             Difference]: Without dead ends: 222
[2025-05-07 17:25:31,568 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-05-07 17:25:31,570 INFO  L437           NwaCegarLoop]: 599 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:31,571 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:31,581 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 222 states.
[2025-05-07 17:25:31,682 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222.
[2025-05-07 17:25:31,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 222 states, 6 states have (on average 28.833333333333332) internal successors, (173), 173 states have internal predecessors, (173), 213 states have call successors, (213), 3 states have call predecessors, (213), 3 states have return successors, (213), 46 states have call predecessors, (213), 213 states have call successors, (213)
[2025-05-07 17:25:31,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 599 transitions.
[2025-05-07 17:25:31,705 INFO  L79                 Accepts]: Start accepts. Automaton has 222 states and 599 transitions. Word has length 5
[2025-05-07 17:25:31,706 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:31,706 INFO  L485      AbstractCegarLoop]: Abstraction has 222 states and 599 transitions.
[2025-05-07 17:25:31,706 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 1.5) internal successors, (3), 1 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2025-05-07 17:25:31,706 INFO  L278                IsEmpty]: Start isEmpty. Operand 222 states and 599 transitions.
[2025-05-07 17:25:31,798 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-05-07 17:25:31,798 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:31,798 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:31,799 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:25:31,799 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:31,799 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:31,799 INFO  L85        PathProgramCache]: Analyzing trace with hash -796612122, now seen corresponding path program 1 times
[2025-05-07 17:25:31,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:31,799 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390517647]
[2025-05-07 17:25:31,799 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:31,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:31,804 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-05-07 17:25:31,815 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-05-07 17:25:31,816 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:31,816 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:31,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:31,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:31,868 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390517647]
[2025-05-07 17:25:31,868 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390517647] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:31,868 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:31,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:31,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691575201]
[2025-05-07 17:25:31,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:31,869 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:31,869 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:31,870 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:31,870 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:31,870 INFO  L87              Difference]: Start difference. First operand 222 states and 599 transitions. Second operand  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:25:34,026 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:34,026 INFO  L93              Difference]: Finished difference Result 318 states and 1068 transitions.
[2025-05-07 17:25:34,027 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:34,027 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 12
[2025-05-07 17:25:34,027 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:34,052 INFO  L225             Difference]: With dead ends: 318
[2025-05-07 17:25:34,052 INFO  L226             Difference]: Without dead ends: 318
[2025-05-07 17:25:34,053 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:34,053 INFO  L437           NwaCegarLoop]: 540 mSDtfsCounter, 50 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:34,053 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1125 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-05-07 17:25:34,054 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2025-05-07 17:25:34,172 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316.
[2025-05-07 17:25:34,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 316 states, 8 states have (on average 28.0) internal successors, (224), 223 states have internal predecessors, (224), 305 states have call successors, (305), 4 states have call predecessors, (305), 4 states have return successors, (537), 89 states have call predecessors, (537), 305 states have call successors, (537)
[2025-05-07 17:25:34,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 1066 transitions.
[2025-05-07 17:25:34,187 INFO  L79                 Accepts]: Start accepts. Automaton has 316 states and 1066 transitions. Word has length 12
[2025-05-07 17:25:34,187 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:34,187 INFO  L485      AbstractCegarLoop]: Abstraction has 316 states and 1066 transitions.
[2025-05-07 17:25:34,187 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:25:34,187 INFO  L278                IsEmpty]: Start isEmpty. Operand 316 states and 1066 transitions.
[2025-05-07 17:25:34,244 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-05-07 17:25:34,244 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:34,244 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:34,244 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:25:34,244 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:34,245 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:34,245 INFO  L85        PathProgramCache]: Analyzing trace with hash -1041862975, now seen corresponding path program 1 times
[2025-05-07 17:25:34,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:34,245 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155291967]
[2025-05-07 17:25:34,245 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:34,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:34,248 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-05-07 17:25:34,253 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-05-07 17:25:34,253 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:34,253 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:34,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:34,285 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:34,285 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155291967]
[2025-05-07 17:25:34,285 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155291967] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:34,285 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:34,285 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:34,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799861608]
[2025-05-07 17:25:34,286 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:34,286 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:34,286 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:34,286 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:34,286 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:34,286 INFO  L87              Difference]: Start difference. First operand 316 states and 1066 transitions. Second operand  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:25:36,143 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:36,143 INFO  L93              Difference]: Finished difference Result 318 states and 1065 transitions.
[2025-05-07 17:25:36,144 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:36,144 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 12
[2025-05-07 17:25:36,144 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:36,165 INFO  L225             Difference]: With dead ends: 318
[2025-05-07 17:25:36,165 INFO  L226             Difference]: Without dead ends: 318
[2025-05-07 17:25:36,166 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:36,166 INFO  L437           NwaCegarLoop]: 545 mSDtfsCounter, 50 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:36,166 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1135 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-05-07 17:25:36,167 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2025-05-07 17:25:36,246 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316.
[2025-05-07 17:25:36,247 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 316 states, 8 states have (on average 28.0) internal successors, (224), 223 states have internal predecessors, (224), 305 states have call successors, (305), 4 states have call predecessors, (305), 4 states have return successors, (534), 89 states have call predecessors, (534), 305 states have call successors, (534)
[2025-05-07 17:25:36,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 1063 transitions.
[2025-05-07 17:25:36,260 INFO  L79                 Accepts]: Start accepts. Automaton has 316 states and 1063 transitions. Word has length 12
[2025-05-07 17:25:36,260 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:36,261 INFO  L485      AbstractCegarLoop]: Abstraction has 316 states and 1063 transitions.
[2025-05-07 17:25:36,261 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:25:36,261 INFO  L278                IsEmpty]: Start isEmpty. Operand 316 states and 1063 transitions.
[2025-05-07 17:25:36,320 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-05-07 17:25:36,320 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:36,320 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:36,320 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:25:36,321 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:36,321 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:36,321 INFO  L85        PathProgramCache]: Analyzing trace with hash -551361269, now seen corresponding path program 1 times
[2025-05-07 17:25:36,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:36,321 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013372500]
[2025-05-07 17:25:36,321 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:36,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:36,324 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-05-07 17:25:36,327 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-05-07 17:25:36,328 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:36,328 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:36,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:36,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:36,355 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013372500]
[2025-05-07 17:25:36,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013372500] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:36,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:36,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:36,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998827417]
[2025-05-07 17:25:36,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:36,355 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:36,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:36,356 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:36,356 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:36,356 INFO  L87              Difference]: Start difference. First operand 316 states and 1063 transitions. Second operand  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:25:38,411 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:38,411 INFO  L93              Difference]: Finished difference Result 316 states and 1061 transitions.
[2025-05-07 17:25:38,412 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:38,412 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 12
[2025-05-07 17:25:38,412 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:38,428 INFO  L225             Difference]: With dead ends: 316
[2025-05-07 17:25:38,428 INFO  L226             Difference]: Without dead ends: 316
[2025-05-07 17:25:38,429 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:38,429 INFO  L437           NwaCegarLoop]: 545 mSDtfsCounter, 50 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:38,429 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1133 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-05-07 17:25:38,430 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 316 states.
[2025-05-07 17:25:38,501 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316.
[2025-05-07 17:25:38,502 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 316 states, 8 states have (on average 28.0) internal successors, (224), 223 states have internal predecessors, (224), 305 states have call successors, (305), 4 states have call predecessors, (305), 4 states have return successors, (532), 89 states have call predecessors, (532), 305 states have call successors, (532)
[2025-05-07 17:25:38,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 1061 transitions.
[2025-05-07 17:25:38,515 INFO  L79                 Accepts]: Start accepts. Automaton has 316 states and 1061 transitions. Word has length 12
[2025-05-07 17:25:38,515 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:38,515 INFO  L485      AbstractCegarLoop]: Abstraction has 316 states and 1061 transitions.
[2025-05-07 17:25:38,516 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:25:38,516 INFO  L278                IsEmpty]: Start isEmpty. Operand 316 states and 1061 transitions.
[2025-05-07 17:25:38,579 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-05-07 17:25:38,579 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:38,579 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:38,579 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:25:38,579 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:38,580 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:38,580 INFO  L85        PathProgramCache]: Analyzing trace with hash 1018759188, now seen corresponding path program 1 times
[2025-05-07 17:25:38,580 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:38,580 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954867387]
[2025-05-07 17:25:38,580 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:38,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:38,583 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-05-07 17:25:38,589 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-05-07 17:25:38,589 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:38,589 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:38,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:38,632 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:38,632 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954867387]
[2025-05-07 17:25:38,632 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954867387] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:38,633 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831955002]
[2025-05-07 17:25:38,633 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:38,633 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:38,635 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:38,637 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:25:38,638 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:25:38,678 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-05-07 17:25:38,699 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-05-07 17:25:38,699 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:38,699 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:38,700 INFO  L256         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:38,705 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:38,736 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:38,736 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:25:38,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:38,847 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [831955002] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:25:38,847 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:25:38,847 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6
[2025-05-07 17:25:38,847 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021974448]
[2025-05-07 17:25:38,847 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:25:38,848 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:38,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:38,848 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:38,848 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:38,848 INFO  L87              Difference]: Start difference. First operand 316 states and 1061 transitions. Second operand  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:25:45,281 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:45,281 INFO  L93              Difference]: Finished difference Result 807 states and 4333 transitions.
[2025-05-07 17:25:45,281 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:25:45,282 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 15
[2025-05-07 17:25:45,282 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:45,391 INFO  L225             Difference]: With dead ends: 807
[2025-05-07 17:25:45,391 INFO  L226             Difference]: Without dead ends: 807
[2025-05-07 17:25:45,391 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:25:45,392 INFO  L437           NwaCegarLoop]: 935 mSDtfsCounter, 213 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 3702 mSolverCounterSat, 1032 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 4734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1032 IncrementalHoareTripleChecker+Valid, 3702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:45,392 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 2501 Invalid, 4734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1032 Valid, 3702 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time]
[2025-05-07 17:25:45,393 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 807 states.
[2025-05-07 17:25:45,862 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 617.
[2025-05-07 17:25:45,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 617 states, 12 states have (on average 36.583333333333336) internal successors, (439), 436 states have internal predecessors, (439), 602 states have call successors, (602), 6 states have call predecessors, (602), 6 states have return successors, (1646), 175 states have call predecessors, (1646), 602 states have call successors, (1646)
[2025-05-07 17:25:45,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 2687 transitions.
[2025-05-07 17:25:45,897 INFO  L79                 Accepts]: Start accepts. Automaton has 617 states and 2687 transitions. Word has length 15
[2025-05-07 17:25:45,898 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:45,898 INFO  L485      AbstractCegarLoop]: Abstraction has 617 states and 2687 transitions.
[2025-05-07 17:25:45,898 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:25:45,898 INFO  L278                IsEmpty]: Start isEmpty. Operand 617 states and 2687 transitions.
[2025-05-07 17:25:46,036 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:25:46,036 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:46,037 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:46,040 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:25:46,237 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-05-07 17:25:46,238 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:46,241 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:46,241 INFO  L85        PathProgramCache]: Analyzing trace with hash -1943537483, now seen corresponding path program 1 times
[2025-05-07 17:25:46,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:46,241 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732713357]
[2025-05-07 17:25:46,242 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:46,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:46,253 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:25:46,264 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:25:46,264 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:46,265 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:46,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:46,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:46,295 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732713357]
[2025-05-07 17:25:46,295 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732713357] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:46,295 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:46,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:46,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149849526]
[2025-05-07 17:25:46,295 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:46,295 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:46,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:46,296 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:46,296 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:46,296 INFO  L87              Difference]: Start difference. First operand 617 states and 2687 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:25:48,384 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:48,384 INFO  L93              Difference]: Finished difference Result 995 states and 6023 transitions.
[2025-05-07 17:25:48,385 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:48,385 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:25:48,385 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:48,583 INFO  L225             Difference]: With dead ends: 995
[2025-05-07 17:25:48,583 INFO  L226             Difference]: Without dead ends: 995
[2025-05-07 17:25:48,583 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:48,583 INFO  L437           NwaCegarLoop]: 749 mSDtfsCounter, 50 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:48,584 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1509 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-05-07 17:25:48,585 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 995 states.
[2025-05-07 17:25:49,350 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 993.
[2025-05-07 17:25:49,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 993 states, 20 states have (on average 39.65) internal successors, (793), 636 states have internal predecessors, (793), 970 states have call successors, (970), 10 states have call predecessors, (970), 10 states have return successors, (4258), 347 states have call predecessors, (4258), 970 states have call successors, (4258)
[2025-05-07 17:25:49,449 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 6021 transitions.
[2025-05-07 17:25:49,449 INFO  L79                 Accepts]: Start accepts. Automaton has 993 states and 6021 transitions. Word has length 16
[2025-05-07 17:25:49,449 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:49,449 INFO  L485      AbstractCegarLoop]: Abstraction has 993 states and 6021 transitions.
[2025-05-07 17:25:49,449 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:25:49,450 INFO  L278                IsEmpty]: Start isEmpty. Operand 993 states and 6021 transitions.
[2025-05-07 17:25:49,658 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:25:49,658 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:49,658 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:49,658 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:25:49,658 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:49,659 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:49,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -123823105, now seen corresponding path program 1 times
[2025-05-07 17:25:49,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:49,659 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441896315]
[2025-05-07 17:25:49,659 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:49,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:49,662 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:25:49,664 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:25:49,664 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:49,664 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:49,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:49,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:49,688 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441896315]
[2025-05-07 17:25:49,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441896315] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:49,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:49,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:49,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052593072]
[2025-05-07 17:25:49,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:49,689 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:49,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:49,689 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:49,689 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:49,689 INFO  L87              Difference]: Start difference. First operand 993 states and 6021 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:25:51,692 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:51,692 INFO  L93              Difference]: Finished difference Result 993 states and 6019 transitions.
[2025-05-07 17:25:51,693 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:51,693 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:25:51,693 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:51,869 INFO  L225             Difference]: With dead ends: 993
[2025-05-07 17:25:51,869 INFO  L226             Difference]: Without dead ends: 993
[2025-05-07 17:25:51,869 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:51,869 INFO  L437           NwaCegarLoop]: 738 mSDtfsCounter, 50 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:51,870 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1485 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-05-07 17:25:51,871 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 993 states.
[2025-05-07 17:25:52,648 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993.
[2025-05-07 17:25:52,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 993 states, 20 states have (on average 39.65) internal successors, (793), 636 states have internal predecessors, (793), 970 states have call successors, (970), 10 states have call predecessors, (970), 10 states have return successors, (4256), 347 states have call predecessors, (4256), 970 states have call successors, (4256)
[2025-05-07 17:25:52,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 6019 transitions.
[2025-05-07 17:25:52,746 INFO  L79                 Accepts]: Start accepts. Automaton has 993 states and 6019 transitions. Word has length 16
[2025-05-07 17:25:52,746 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:52,746 INFO  L485      AbstractCegarLoop]: Abstraction has 993 states and 6019 transitions.
[2025-05-07 17:25:52,746 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:25:52,746 INFO  L278                IsEmpty]: Start isEmpty. Operand 993 states and 6019 transitions.
[2025-05-07 17:25:52,969 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:25:52,970 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:52,970 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:52,970 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:25:52,970 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:52,970 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:52,970 INFO  L85        PathProgramCache]: Analyzing trace with hash 37334075, now seen corresponding path program 1 times
[2025-05-07 17:25:52,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:52,971 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167217108]
[2025-05-07 17:25:52,971 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:52,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:52,974 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:25:52,976 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:25:52,977 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:52,977 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:53,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:53,007 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:53,007 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167217108]
[2025-05-07 17:25:53,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167217108] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:53,007 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:53,007 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:53,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261602141]
[2025-05-07 17:25:53,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:53,007 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:53,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:53,008 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:53,008 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:53,008 INFO  L87              Difference]: Start difference. First operand 993 states and 6019 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:25:55,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:55,097 INFO  L93              Difference]: Finished difference Result 1371 states and 10357 transitions.
[2025-05-07 17:25:55,098 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:55,098 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:25:55,098 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:55,506 INFO  L225             Difference]: With dead ends: 1371
[2025-05-07 17:25:55,506 INFO  L226             Difference]: Without dead ends: 1371
[2025-05-07 17:25:55,506 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:55,507 INFO  L437           NwaCegarLoop]: 746 mSDtfsCounter, 50 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:55,507 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1492 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-05-07 17:25:55,508 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1371 states.
[2025-05-07 17:25:57,154 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369.
[2025-05-07 17:25:57,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1369 states, 28 states have (on average 41.535714285714285) internal successors, (1163), 836 states have internal predecessors, (1163), 1338 states have call successors, (1338), 14 states have call predecessors, (1338), 14 states have return successors, (7854), 519 states have call predecessors, (7854), 1338 states have call successors, (7854)
[2025-05-07 17:25:57,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 10355 transitions.
[2025-05-07 17:25:57,345 INFO  L79                 Accepts]: Start accepts. Automaton has 1369 states and 10355 transitions. Word has length 16
[2025-05-07 17:25:57,345 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:57,345 INFO  L485      AbstractCegarLoop]: Abstraction has 1369 states and 10355 transitions.
[2025-05-07 17:25:57,346 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:25:57,346 INFO  L278                IsEmpty]: Start isEmpty. Operand 1369 states and 10355 transitions.
[2025-05-07 17:25:57,682 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:25:57,682 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:57,683 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:57,683 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:25:57,683 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:57,684 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:57,684 INFO  L85        PathProgramCache]: Analyzing trace with hash 1703989865, now seen corresponding path program 1 times
[2025-05-07 17:25:57,684 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:57,684 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092510715]
[2025-05-07 17:25:57,684 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:57,684 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:57,688 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:25:57,690 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:25:57,690 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:57,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:57,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:57,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:57,712 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092510715]
[2025-05-07 17:25:57,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092510715] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:57,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:57,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:57,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395331788]
[2025-05-07 17:25:57,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:57,713 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:57,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:57,713 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:57,713 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:57,713 INFO  L87              Difference]: Start difference. First operand 1369 states and 10355 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:25:59,848 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:59,848 INFO  L93              Difference]: Finished difference Result 1371 states and 10355 transitions.
[2025-05-07 17:25:59,848 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:59,848 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:25:59,849 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:00,266 INFO  L225             Difference]: With dead ends: 1371
[2025-05-07 17:26:00,266 INFO  L226             Difference]: Without dead ends: 1371
[2025-05-07 17:26:00,267 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:00,267 INFO  L437           NwaCegarLoop]: 738 mSDtfsCounter, 50 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:00,267 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1474 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-05-07 17:26:00,268 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1371 states.
[2025-05-07 17:26:01,814 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369.
[2025-05-07 17:26:01,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1369 states, 28 states have (on average 41.535714285714285) internal successors, (1163), 836 states have internal predecessors, (1163), 1338 states have call successors, (1338), 14 states have call predecessors, (1338), 14 states have return successors, (7852), 519 states have call predecessors, (7852), 1338 states have call successors, (7852)
[2025-05-07 17:26:02,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 10353 transitions.
[2025-05-07 17:26:02,022 INFO  L79                 Accepts]: Start accepts. Automaton has 1369 states and 10353 transitions. Word has length 16
[2025-05-07 17:26:02,022 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:02,022 INFO  L485      AbstractCegarLoop]: Abstraction has 1369 states and 10353 transitions.
[2025-05-07 17:26:02,023 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:02,023 INFO  L278                IsEmpty]: Start isEmpty. Operand 1369 states and 10353 transitions.
[2025-05-07 17:26:02,312 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:26:02,312 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:02,313 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:02,313 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:26:02,313 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:02,315 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:02,315 INFO  L85        PathProgramCache]: Analyzing trace with hash -1200292384, now seen corresponding path program 1 times
[2025-05-07 17:26:02,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:02,315 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796014699]
[2025-05-07 17:26:02,315 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:02,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:02,318 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:26:02,320 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:26:02,320 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:02,320 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:02,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:26:02,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:02,338 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796014699]
[2025-05-07 17:26:02,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796014699] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:02,338 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:02,338 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:02,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125167942]
[2025-05-07 17:26:02,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:02,338 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:02,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:02,339 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:02,339 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:02,339 INFO  L87              Difference]: Start difference. First operand 1369 states and 10353 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:04,442 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:04,442 INFO  L93              Difference]: Finished difference Result 1371 states and 10351 transitions.
[2025-05-07 17:26:04,444 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:04,444 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:26:04,444 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:04,851 INFO  L225             Difference]: With dead ends: 1371
[2025-05-07 17:26:04,851 INFO  L226             Difference]: Without dead ends: 1371
[2025-05-07 17:26:04,852 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:04,852 INFO  L437           NwaCegarLoop]: 738 mSDtfsCounter, 50 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:04,852 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1472 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-05-07 17:26:04,853 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1371 states.
[2025-05-07 17:26:06,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369.
[2025-05-07 17:26:06,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1369 states, 28 states have (on average 41.535714285714285) internal successors, (1163), 836 states have internal predecessors, (1163), 1338 states have call successors, (1338), 14 states have call predecessors, (1338), 14 states have return successors, (7848), 519 states have call predecessors, (7848), 1338 states have call successors, (7848)
[2025-05-07 17:26:07,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 10349 transitions.
[2025-05-07 17:26:07,058 INFO  L79                 Accepts]: Start accepts. Automaton has 1369 states and 10349 transitions. Word has length 16
[2025-05-07 17:26:07,058 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:07,058 INFO  L485      AbstractCegarLoop]: Abstraction has 1369 states and 10349 transitions.
[2025-05-07 17:26:07,059 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:07,059 INFO  L278                IsEmpty]: Start isEmpty. Operand 1369 states and 10349 transitions.
[2025-05-07 17:26:07,336 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:26:07,336 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:07,337 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:07,337 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:26:07,337 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:07,339 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:07,339 INFO  L85        PathProgramCache]: Analyzing trace with hash -544753844, now seen corresponding path program 1 times
[2025-05-07 17:26:07,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:07,339 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9537494]
[2025-05-07 17:26:07,339 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:07,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:07,342 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:26:07,344 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:26:07,344 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:07,344 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:07,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:26:07,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:07,361 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9537494]
[2025-05-07 17:26:07,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9537494] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:07,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:07,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:07,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360067623]
[2025-05-07 17:26:07,362 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:07,362 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:07,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:07,362 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:07,362 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:07,362 INFO  L87              Difference]: Start difference. First operand 1369 states and 10349 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:09,245 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:09,245 INFO  L93              Difference]: Finished difference Result 1371 states and 10349 transitions.
[2025-05-07 17:26:09,245 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:09,245 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:26:09,245 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:09,631 INFO  L225             Difference]: With dead ends: 1371
[2025-05-07 17:26:09,631 INFO  L226             Difference]: Without dead ends: 1371
[2025-05-07 17:26:09,631 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:09,632 INFO  L437           NwaCegarLoop]: 740 mSDtfsCounter, 50 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:09,632 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1475 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-05-07 17:26:09,633 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1371 states.
[2025-05-07 17:26:11,308 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369.
[2025-05-07 17:26:11,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1369 states, 28 states have (on average 41.535714285714285) internal successors, (1163), 836 states have internal predecessors, (1163), 1338 states have call successors, (1338), 14 states have call predecessors, (1338), 14 states have return successors, (7846), 519 states have call predecessors, (7846), 1338 states have call successors, (7846)
[2025-05-07 17:26:11,526 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 10347 transitions.
[2025-05-07 17:26:11,526 INFO  L79                 Accepts]: Start accepts. Automaton has 1369 states and 10347 transitions. Word has length 16
[2025-05-07 17:26:11,526 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:11,526 INFO  L485      AbstractCegarLoop]: Abstraction has 1369 states and 10347 transitions.
[2025-05-07 17:26:11,526 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:11,526 INFO  L278                IsEmpty]: Start isEmpty. Operand 1369 states and 10347 transitions.
[2025-05-07 17:26:11,827 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:26:11,827 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:11,827 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:11,827 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:26:11,827 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:11,828 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:11,828 INFO  L85        PathProgramCache]: Analyzing trace with hash 1274960534, now seen corresponding path program 1 times
[2025-05-07 17:26:11,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:11,828 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272315956]
[2025-05-07 17:26:11,828 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:11,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:11,832 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:26:11,834 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:26:11,834 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:11,834 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:11,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:26:11,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:11,855 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272315956]
[2025-05-07 17:26:11,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272315956] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:11,855 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:11,855 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:11,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19560231]
[2025-05-07 17:26:11,855 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:11,855 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:11,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:11,855 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:11,856 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:11,856 INFO  L87              Difference]: Start difference. First operand 1369 states and 10347 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:13,660 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:13,660 INFO  L93              Difference]: Finished difference Result 1369 states and 10345 transitions.
[2025-05-07 17:26:13,661 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:13,661 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:26:13,661 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:14,068 INFO  L225             Difference]: With dead ends: 1369
[2025-05-07 17:26:14,068 INFO  L226             Difference]: Without dead ends: 1369
[2025-05-07 17:26:14,068 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:14,068 INFO  L437           NwaCegarLoop]: 742 mSDtfsCounter, 50 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:14,069 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1477 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-05-07 17:26:14,069 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1369 states.
[2025-05-07 17:26:15,892 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1369.
[2025-05-07 17:26:15,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1369 states, 28 states have (on average 41.535714285714285) internal successors, (1163), 836 states have internal predecessors, (1163), 1338 states have call successors, (1338), 14 states have call predecessors, (1338), 14 states have return successors, (7844), 519 states have call predecessors, (7844), 1338 states have call successors, (7844)
[2025-05-07 17:26:16,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 10345 transitions.
[2025-05-07 17:26:16,089 INFO  L79                 Accepts]: Start accepts. Automaton has 1369 states and 10345 transitions. Word has length 16
[2025-05-07 17:26:16,089 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:16,089 INFO  L485      AbstractCegarLoop]: Abstraction has 1369 states and 10345 transitions.
[2025-05-07 17:26:16,089 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:16,089 INFO  L278                IsEmpty]: Start isEmpty. Operand 1369 states and 10345 transitions.
[2025-05-07 17:26:16,388 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:26:16,388 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:16,388 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:16,388 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:26:16,388 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:16,390 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:16,390 INFO  L85        PathProgramCache]: Analyzing trace with hash 1812092081, now seen corresponding path program 1 times
[2025-05-07 17:26:16,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:16,391 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166662658]
[2025-05-07 17:26:16,391 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:16,391 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:16,393 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:26:16,395 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:26:16,395 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:16,395 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:16,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:26:16,409 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:16,409 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166662658]
[2025-05-07 17:26:16,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166662658] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:16,409 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:16,409 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:16,409 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033733330]
[2025-05-07 17:26:16,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:16,409 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:16,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:16,409 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:16,409 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:16,409 INFO  L87              Difference]: Start difference. First operand 1369 states and 10345 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:18,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:18,657 INFO  L93              Difference]: Finished difference Result 1745 states and 15687 transitions.
[2025-05-07 17:26:18,658 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:18,658 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:26:18,658 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:19,407 INFO  L225             Difference]: With dead ends: 1745
[2025-05-07 17:26:19,407 INFO  L226             Difference]: Without dead ends: 1745
[2025-05-07 17:26:19,408 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:19,408 INFO  L437           NwaCegarLoop]: 740 mSDtfsCounter, 50 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:19,408 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1435 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-05-07 17:26:19,409 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1745 states.
[2025-05-07 17:26:22,103 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1745.
[2025-05-07 17:26:22,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1745 states, 36 states have (on average 43.638888888888886) internal successors, (1571), 1036 states have internal predecessors, (1571), 1706 states have call successors, (1706), 18 states have call predecessors, (1706), 18 states have return successors, (12410), 691 states have call predecessors, (12410), 1706 states have call successors, (12410)
[2025-05-07 17:26:22,568 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 15687 transitions.
[2025-05-07 17:26:22,568 INFO  L79                 Accepts]: Start accepts. Automaton has 1745 states and 15687 transitions. Word has length 16
[2025-05-07 17:26:22,569 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:22,569 INFO  L485      AbstractCegarLoop]: Abstraction has 1745 states and 15687 transitions.
[2025-05-07 17:26:22,569 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:22,569 INFO  L278                IsEmpty]: Start isEmpty. Operand 1745 states and 15687 transitions.
[2025-05-07 17:26:22,949 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:26:22,949 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:22,950 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:22,950 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:26:22,950 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:22,952 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:22,952 INFO  L85        PathProgramCache]: Analyzing trace with hash -332142842, now seen corresponding path program 1 times
[2025-05-07 17:26:22,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:22,952 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668634678]
[2025-05-07 17:26:22,952 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:22,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:22,955 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:26:22,957 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:26:22,957 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:22,957 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:22,971 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:26:22,972 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:22,972 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668634678]
[2025-05-07 17:26:22,972 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668634678] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:22,972 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:22,972 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:22,972 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297164418]
[2025-05-07 17:26:22,972 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:22,972 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:22,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:22,973 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:22,973 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:22,973 INFO  L87              Difference]: Start difference. First operand 1745 states and 15687 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:25,271 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:25,271 INFO  L93              Difference]: Finished difference Result 2123 states and 20679 transitions.
[2025-05-07 17:26:25,271 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:25,272 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:26:25,272 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:26,296 INFO  L225             Difference]: With dead ends: 2123
[2025-05-07 17:26:26,296 INFO  L226             Difference]: Without dead ends: 2123
[2025-05-07 17:26:26,296 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:26,297 INFO  L437           NwaCegarLoop]: 534 mSDtfsCounter, 50 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:26,297 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1104 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-05-07 17:26:26,298 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2123 states.
[2025-05-07 17:26:30,215 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121.
[2025-05-07 17:26:30,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2121 states, 44 states have (on average 40.47727272727273) internal successors, (1781), 1236 states have internal predecessors, (1781), 2074 states have call successors, (2074), 22 states have call predecessors, (2074), 22 states have return successors, (16822), 863 states have call predecessors, (16822), 2074 states have call successors, (16822)
[2025-05-07 17:26:30,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 20677 transitions.
[2025-05-07 17:26:30,722 INFO  L79                 Accepts]: Start accepts. Automaton has 2121 states and 20677 transitions. Word has length 16
[2025-05-07 17:26:30,722 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:30,723 INFO  L485      AbstractCegarLoop]: Abstraction has 2121 states and 20677 transitions.
[2025-05-07 17:26:30,723 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:30,723 INFO  L278                IsEmpty]: Start isEmpty. Operand 2121 states and 20677 transitions.
[2025-05-07 17:26:31,262 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:26:31,262 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:31,262 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:31,263 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:26:31,263 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:31,265 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:31,265 INFO  L85        PathProgramCache]: Analyzing trace with hash -987681382, now seen corresponding path program 1 times
[2025-05-07 17:26:31,265 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:31,265 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932701512]
[2025-05-07 17:26:31,265 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:31,265 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:31,268 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:26:31,269 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:26:31,269 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:31,269 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:31,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:26:31,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:31,284 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932701512]
[2025-05-07 17:26:31,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932701512] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:31,284 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:31,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:31,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314979520]
[2025-05-07 17:26:31,284 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:31,285 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:31,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:31,285 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:31,285 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:31,285 INFO  L87              Difference]: Start difference. First operand 2121 states and 20677 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:33,612 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:33,612 INFO  L93              Difference]: Finished difference Result 2123 states and 20677 transitions.
[2025-05-07 17:26:33,613 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:33,613 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:26:33,613 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:34,656 INFO  L225             Difference]: With dead ends: 2123
[2025-05-07 17:26:34,656 INFO  L226             Difference]: Without dead ends: 2123
[2025-05-07 17:26:34,656 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:34,657 INFO  L437           NwaCegarLoop]: 531 mSDtfsCounter, 50 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:34,657 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1097 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-05-07 17:26:34,658 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2123 states.
[2025-05-07 17:26:38,045 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121.
[2025-05-07 17:26:38,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2121 states, 44 states have (on average 40.47727272727273) internal successors, (1781), 1236 states have internal predecessors, (1781), 2074 states have call successors, (2074), 22 states have call predecessors, (2074), 22 states have return successors, (16820), 863 states have call predecessors, (16820), 2074 states have call successors, (16820)
[2025-05-07 17:26:38,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 20675 transitions.
[2025-05-07 17:26:38,602 INFO  L79                 Accepts]: Start accepts. Automaton has 2121 states and 20675 transitions. Word has length 16
[2025-05-07 17:26:38,603 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:38,603 INFO  L485      AbstractCegarLoop]: Abstraction has 2121 states and 20675 transitions.
[2025-05-07 17:26:38,603 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:38,603 INFO  L278                IsEmpty]: Start isEmpty. Operand 2121 states and 20675 transitions.
[2025-05-07 17:26:39,144 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:26:39,144 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:39,144 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:39,144 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-05-07 17:26:39,145 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:39,147 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:39,147 INFO  L85        PathProgramCache]: Analyzing trace with hash -1569769301, now seen corresponding path program 1 times
[2025-05-07 17:26:39,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:39,147 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507494341]
[2025-05-07 17:26:39,147 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:39,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:39,150 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:26:39,151 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:26:39,151 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:39,151 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:39,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:26:39,165 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:39,165 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507494341]
[2025-05-07 17:26:39,166 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507494341] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:39,166 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:39,166 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:39,166 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091928758]
[2025-05-07 17:26:39,166 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:39,166 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:39,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:39,166 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:39,166 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:39,167 INFO  L87              Difference]: Start difference. First operand 2121 states and 20675 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-05-07 17:26:43,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:43,097 INFO  L93              Difference]: Finished difference Result 2353 states and 42477 transitions.
[2025-05-07 17:26:43,098 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:26:43,098 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16
[2025-05-07 17:26:43,098 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:45,193 INFO  L225             Difference]: With dead ends: 2353
[2025-05-07 17:26:45,194 INFO  L226             Difference]: Without dead ends: 2353
[2025-05-07 17:26:45,194 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:26:45,194 INFO  L437           NwaCegarLoop]: 803 mSDtfsCounter, 50 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:45,194 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1573 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-05-07 17:26:45,196 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2353 states.
[2025-05-07 17:26:53,091 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2309.
[2025-05-07 17:26:53,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2309 states, 48 states have (on average 39.229166666666664) internal successors, (1883), 1336 states have internal predecessors, (1883), 2258 states have call successors, (2258), 24 states have call predecessors, (2258), 24 states have return successors, (19158), 949 states have call predecessors, (19158), 2258 states have call successors, (19158)
[2025-05-07 17:26:53,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 23299 transitions.
[2025-05-07 17:26:53,724 INFO  L79                 Accepts]: Start accepts. Automaton has 2309 states and 23299 transitions. Word has length 16
[2025-05-07 17:26:53,724 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:53,725 INFO  L485      AbstractCegarLoop]: Abstraction has 2309 states and 23299 transitions.
[2025-05-07 17:26:53,725 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-05-07 17:26:53,725 INFO  L278                IsEmpty]: Start isEmpty. Operand 2309 states and 23299 transitions.
[2025-05-07 17:26:54,299 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:26:54,299 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:54,299 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:54,299 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-05-07 17:26:54,299 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:54,301 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:54,301 INFO  L85        PathProgramCache]: Analyzing trace with hash 1386024692, now seen corresponding path program 1 times
[2025-05-07 17:26:54,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:54,301 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136454481]
[2025-05-07 17:26:54,301 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:54,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:54,304 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:26:54,306 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:26:54,306 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:54,306 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:54,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:26:54,320 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:54,320 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136454481]
[2025-05-07 17:26:54,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136454481] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:54,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:54,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:54,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221099858]
[2025-05-07 17:26:54,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:54,321 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:54,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:54,321 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:54,321 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:54,321 INFO  L87              Difference]: Start difference. First operand 2309 states and 23299 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:26:57,057 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:57,057 INFO  L93              Difference]: Finished difference Result 2687 states and 30389 transitions.
[2025-05-07 17:26:57,058 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:57,058 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:26:57,058 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:58,832 INFO  L225             Difference]: With dead ends: 2687
[2025-05-07 17:26:58,832 INFO  L226             Difference]: Without dead ends: 2687
[2025-05-07 17:26:58,832 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:58,833 INFO  L437           NwaCegarLoop]: 753 mSDtfsCounter, 50 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:58,833 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1464 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-05-07 17:26:58,834 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2687 states.
[2025-05-07 17:27:05,789 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2685.
[2025-05-07 17:27:05,798 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2685 states, 56 states have (on average 41.017857142857146) internal successors, (2297), 1536 states have internal predecessors, (2297), 2626 states have call successors, (2626), 28 states have call predecessors, (2626), 28 states have return successors, (25464), 1121 states have call predecessors, (25464), 2626 states have call successors, (25464)
[2025-05-07 17:27:06,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 30387 transitions.
[2025-05-07 17:27:06,690 INFO  L79                 Accepts]: Start accepts. Automaton has 2685 states and 30387 transitions. Word has length 16
[2025-05-07 17:27:06,690 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:06,690 INFO  L485      AbstractCegarLoop]: Abstraction has 2685 states and 30387 transitions.
[2025-05-07 17:27:06,690 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:27:06,690 INFO  L278                IsEmpty]: Start isEmpty. Operand 2685 states and 30387 transitions.
[2025-05-07 17:27:07,406 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:27:07,406 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:07,406 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:07,406 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-05-07 17:27:07,406 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:07,407 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:07,407 INFO  L85        PathProgramCache]: Analyzing trace with hash 2041563232, now seen corresponding path program 1 times
[2025-05-07 17:27:07,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:07,407 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960552017]
[2025-05-07 17:27:07,407 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:07,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:07,410 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:27:07,411 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:27:07,411 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:07,411 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:07,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:27:07,427 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:07,427 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960552017]
[2025-05-07 17:27:07,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960552017] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:07,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:07,427 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:07,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369144852]
[2025-05-07 17:27:07,427 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:07,427 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:07,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:07,428 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:07,428 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:07,428 INFO  L87              Difference]: Start difference. First operand 2685 states and 30387 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:27:10,722 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:10,723 INFO  L93              Difference]: Finished difference Result 2687 states and 30387 transitions.
[2025-05-07 17:27:10,724 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:10,724 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:27:10,724 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:12,496 INFO  L225             Difference]: With dead ends: 2687
[2025-05-07 17:27:12,496 INFO  L226             Difference]: Without dead ends: 2687
[2025-05-07 17:27:12,496 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:12,497 INFO  L437           NwaCegarLoop]: 678 mSDtfsCounter, 50 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:12,497 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1306 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-05-07 17:27:12,498 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2687 states.
[2025-05-07 17:27:18,402 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2685.
[2025-05-07 17:27:18,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2685 states, 56 states have (on average 41.017857142857146) internal successors, (2297), 1536 states have internal predecessors, (2297), 2626 states have call successors, (2626), 28 states have call predecessors, (2626), 28 states have return successors, (25462), 1121 states have call predecessors, (25462), 2626 states have call successors, (25462)
[2025-05-07 17:27:19,325 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 30385 transitions.
[2025-05-07 17:27:19,325 INFO  L79                 Accepts]: Start accepts. Automaton has 2685 states and 30385 transitions. Word has length 16
[2025-05-07 17:27:19,325 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:19,325 INFO  L485      AbstractCegarLoop]: Abstraction has 2685 states and 30385 transitions.
[2025-05-07 17:27:19,325 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:27:19,326 INFO  L278                IsEmpty]: Start isEmpty. Operand 2685 states and 30385 transitions.
[2025-05-07 17:27:20,205 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:27:20,205 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:20,205 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:20,205 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-05-07 17:27:20,205 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:20,207 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:20,207 INFO  L85        PathProgramCache]: Analyzing trace with hash -433689686, now seen corresponding path program 1 times
[2025-05-07 17:27:20,207 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:20,207 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025639440]
[2025-05-07 17:27:20,207 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:20,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:20,210 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:27:20,212 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:27:20,212 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:20,212 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:20,225 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:27:20,225 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:20,225 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025639440]
[2025-05-07 17:27:20,225 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025639440] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:20,225 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:20,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:20,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122469661]
[2025-05-07 17:27:20,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:20,225 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:20,226 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:20,226 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:20,226 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:20,226 INFO  L87              Difference]: Start difference. First operand 2685 states and 30385 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:27:23,304 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:23,304 INFO  L93              Difference]: Finished difference Result 2685 states and 30383 transitions.
[2025-05-07 17:27:23,305 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:23,305 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:27:23,305 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:25,089 INFO  L225             Difference]: With dead ends: 2685
[2025-05-07 17:27:25,089 INFO  L226             Difference]: Without dead ends: 2685
[2025-05-07 17:27:25,089 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:25,090 INFO  L437           NwaCegarLoop]: 677 mSDtfsCounter, 50 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:25,090 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1302 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-05-07 17:27:25,091 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2685 states.
[2025-05-07 17:27:31,823 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2685.
[2025-05-07 17:27:31,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2685 states, 56 states have (on average 41.017857142857146) internal successors, (2297), 1536 states have internal predecessors, (2297), 2626 states have call successors, (2626), 28 states have call predecessors, (2626), 28 states have return successors, (25460), 1121 states have call predecessors, (25460), 2626 states have call successors, (25460)
[2025-05-07 17:27:32,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 30383 transitions.
[2025-05-07 17:27:32,735 INFO  L79                 Accepts]: Start accepts. Automaton has 2685 states and 30383 transitions. Word has length 16
[2025-05-07 17:27:32,735 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:32,735 INFO  L485      AbstractCegarLoop]: Abstraction has 2685 states and 30383 transitions.
[2025-05-07 17:27:32,735 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:27:32,735 INFO  L278                IsEmpty]: Start isEmpty. Operand 2685 states and 30383 transitions.
[2025-05-07 17:27:33,621 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:27:33,621 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:33,622 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:33,622 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-05-07 17:27:33,622 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:33,625 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:33,625 INFO  L85        PathProgramCache]: Analyzing trace with hash -488222745, now seen corresponding path program 1 times
[2025-05-07 17:27:33,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:33,625 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191355049]
[2025-05-07 17:27:33,626 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:33,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:33,629 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:27:33,630 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:27:33,630 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:33,631 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:33,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:27:33,647 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:33,647 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191355049]
[2025-05-07 17:27:33,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191355049] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:33,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:33,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:33,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718843487]
[2025-05-07 17:27:33,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:33,647 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:33,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:33,648 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:33,648 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:33,648 INFO  L87              Difference]: Start difference. First operand 2685 states and 30383 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:27:37,252 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:37,252 INFO  L93              Difference]: Finished difference Result 3063 states and 38461 transitions.
[2025-05-07 17:27:37,253 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:37,254 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:27:37,254 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:39,680 INFO  L225             Difference]: With dead ends: 3063
[2025-05-07 17:27:39,680 INFO  L226             Difference]: Without dead ends: 3063
[2025-05-07 17:27:39,680 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:39,681 INFO  L437           NwaCegarLoop]: 689 mSDtfsCounter, 50 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:39,681 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1324 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-05-07 17:27:39,682 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3063 states.
[2025-05-07 17:27:48,318 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3061.
[2025-05-07 17:27:48,329 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3061 states, 64 states have (on average 42.453125) internal successors, (2717), 1736 states have internal predecessors, (2717), 2994 states have call successors, (2994), 32 states have call predecessors, (2994), 32 states have return successors, (32748), 1293 states have call predecessors, (32748), 2994 states have call successors, (32748)
[2025-05-07 17:27:49,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 38459 transitions.
[2025-05-07 17:27:49,642 INFO  L79                 Accepts]: Start accepts. Automaton has 3061 states and 38459 transitions. Word has length 16
[2025-05-07 17:27:49,643 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:49,643 INFO  L485      AbstractCegarLoop]: Abstraction has 3061 states and 38459 transitions.
[2025-05-07 17:27:49,643 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:27:49,643 INFO  L278                IsEmpty]: Start isEmpty. Operand 3061 states and 38459 transitions.
[2025-05-07 17:27:50,486 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:27:50,486 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:50,486 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:50,486 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-05-07 17:27:50,486 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:50,489 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:50,489 INFO  L85        PathProgramCache]: Analyzing trace with hash 320374383, now seen corresponding path program 1 times
[2025-05-07 17:27:50,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:50,489 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867888124]
[2025-05-07 17:27:50,489 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:50,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:50,492 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:27:50,493 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:27:50,493 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:50,494 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:50,506 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:27:50,506 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:50,507 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867888124]
[2025-05-07 17:27:50,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867888124] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:50,507 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:50,507 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:50,507 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783912802]
[2025-05-07 17:27:50,507 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:50,507 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:50,507 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:50,507 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:50,507 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:50,507 INFO  L87              Difference]: Start difference. First operand 3061 states and 38459 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:27:53,783 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:53,783 INFO  L93              Difference]: Finished difference Result 3063 states and 38459 transitions.
[2025-05-07 17:27:53,784 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:53,784 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:27:53,784 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:56,115 INFO  L225             Difference]: With dead ends: 3063
[2025-05-07 17:27:56,115 INFO  L226             Difference]: Without dead ends: 3063
[2025-05-07 17:27:56,115 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:56,116 INFO  L437           NwaCegarLoop]: 683 mSDtfsCounter, 50 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:56,116 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1312 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-05-07 17:27:56,117 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3063 states.
[2025-05-07 17:28:04,619 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3061.
[2025-05-07 17:28:04,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3061 states, 64 states have (on average 42.453125) internal successors, (2717), 1736 states have internal predecessors, (2717), 2994 states have call successors, (2994), 32 states have call predecessors, (2994), 32 states have return successors, (32746), 1293 states have call predecessors, (32746), 2994 states have call successors, (32746)
[2025-05-07 17:28:05,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 38457 transitions.
[2025-05-07 17:28:05,938 INFO  L79                 Accepts]: Start accepts. Automaton has 3061 states and 38457 transitions. Word has length 16
[2025-05-07 17:28:05,938 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:05,938 INFO  L485      AbstractCegarLoop]: Abstraction has 3061 states and 38457 transitions.
[2025-05-07 17:28:05,938 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:28:05,938 INFO  L278                IsEmpty]: Start isEmpty. Operand 3061 states and 38457 transitions.
[2025-05-07 17:28:06,780 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:28:06,780 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:06,780 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:06,780 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-05-07 17:28:06,780 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:06,781 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:06,781 INFO  L85        PathProgramCache]: Analyzing trace with hash 902462302, now seen corresponding path program 1 times
[2025-05-07 17:28:06,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:06,781 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354648617]
[2025-05-07 17:28:06,781 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:06,781 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:06,784 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:28:06,785 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:28:06,785 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:06,785 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:06,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:28:06,799 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:06,799 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354648617]
[2025-05-07 17:28:06,799 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354648617] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:06,799 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:06,799 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:06,799 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745898264]
[2025-05-07 17:28:06,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:06,799 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:06,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:06,800 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:06,800 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:06,800 INFO  L87              Difference]: Start difference. First operand 3061 states and 38457 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-05-07 17:28:12,451 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:12,451 INFO  L93              Difference]: Finished difference Result 3121 states and 71171 transitions.
[2025-05-07 17:28:12,451 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:28:12,452 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16
[2025-05-07 17:28:12,452 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:16,798 INFO  L225             Difference]: With dead ends: 3121
[2025-05-07 17:28:16,798 INFO  L226             Difference]: Without dead ends: 3121
[2025-05-07 17:28:16,798 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:16,801 INFO  L437           NwaCegarLoop]: 791 mSDtfsCounter, 50 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:16,801 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1530 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-05-07 17:28:16,802 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3121 states.
[2025-05-07 17:28:31,350 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 3061.
[2025-05-07 17:28:31,361 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3061 states, 64 states have (on average 42.453125) internal successors, (2717), 1736 states have internal predecessors, (2717), 2994 states have call successors, (2994), 32 states have call predecessors, (2994), 32 states have return successors, (32716), 1293 states have call predecessors, (32716), 2994 states have call successors, (32716)
[2025-05-07 17:28:32,590 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 38427 transitions.
[2025-05-07 17:28:32,590 INFO  L79                 Accepts]: Start accepts. Automaton has 3061 states and 38427 transitions. Word has length 16
[2025-05-07 17:28:32,590 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:32,590 INFO  L485      AbstractCegarLoop]: Abstraction has 3061 states and 38427 transitions.
[2025-05-07 17:28:32,590 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-05-07 17:28:32,590 INFO  L278                IsEmpty]: Start isEmpty. Operand 3061 states and 38427 transitions.
[2025-05-07 17:28:33,655 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-05-07 17:28:33,655 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:33,656 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:33,656 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-05-07 17:28:33,656 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:33,659 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:33,660 INFO  L85        PathProgramCache]: Analyzing trace with hash -2062642146, now seen corresponding path program 1 times
[2025-05-07 17:28:33,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:33,660 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983285737]
[2025-05-07 17:28:33,660 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:33,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:33,663 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-05-07 17:28:33,665 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-05-07 17:28:33,665 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:33,665 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:33,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:28:33,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:33,686 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983285737]
[2025-05-07 17:28:33,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983285737] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:33,686 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759392966]
[2025-05-07 17:28:33,686 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:33,686 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:33,690 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:33,692 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:33,693 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:28:33,729 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-05-07 17:28:33,750 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-05-07 17:28:33,750 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:33,750 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:33,751 INFO  L256         TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:33,752 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:33,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:28:33,762 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:33,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:28:33,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759392966] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:33,882 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:33,882 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6
[2025-05-07 17:28:33,883 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471990242]
[2025-05-07 17:28:33,883 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:33,883 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:33,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:33,883 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:33,883 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:33,883 INFO  L87              Difference]: Start difference. First operand 3061 states and 38427 transitions. Second operand  has 6 states, 4 states have (on average 2.5) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:29:11,556 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:11,557 INFO  L93              Difference]: Finished difference Result 3181 states and 93829 transitions.
[2025-05-07 17:29:11,558 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:29:11,558 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.5) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 19
[2025-05-07 17:29:11,558 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:17,486 INFO  L225             Difference]: With dead ends: 3181
[2025-05-07 17:29:17,486 INFO  L226             Difference]: Without dead ends: 3181
[2025-05-07 17:29:17,486 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:29:17,487 INFO  L437           NwaCegarLoop]: 982 mSDtfsCounter, 217 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 6483 mSolverCounterSat, 1405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 7888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1405 IncrementalHoareTripleChecker+Valid, 6483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:17,487 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1942 Invalid, 7888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1405 Valid, 6483 Invalid, 0 Unknown, 0 Unchecked, 34.0s Time]
[2025-05-07 17:29:17,488 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3181 states.
[2025-05-07 17:29:34,161 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3061.
[2025-05-07 17:29:34,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3061 states, 64 states have (on average 42.453125) internal successors, (2717), 1736 states have internal predecessors, (2717), 2994 states have call successors, (2994), 32 states have call predecessors, (2994), 32 states have return successors, (29354), 1293 states have call predecessors, (29354), 2994 states have call successors, (29354)
[2025-05-07 17:29:35,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 35065 transitions.
[2025-05-07 17:29:35,298 INFO  L79                 Accepts]: Start accepts. Automaton has 3061 states and 35065 transitions. Word has length 19
[2025-05-07 17:29:35,298 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:35,298 INFO  L485      AbstractCegarLoop]: Abstraction has 3061 states and 35065 transitions.
[2025-05-07 17:29:35,298 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.5) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:29:35,298 INFO  L278                IsEmpty]: Start isEmpty. Operand 3061 states and 35065 transitions.
[2025-05-07 17:29:36,366 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:29:36,366 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:36,366 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:36,370 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-05-07 17:29:36,567 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:36,568 INFO  L403      AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:36,588 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:36,588 INFO  L85        PathProgramCache]: Analyzing trace with hash -804424142, now seen corresponding path program 1 times
[2025-05-07 17:29:36,589 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:36,589 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537497958]
[2025-05-07 17:29:36,589 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:36,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:36,607 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:29:36,611 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:29:36,611 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:36,611 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:36,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:29:36,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:36,635 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537497958]
[2025-05-07 17:29:36,635 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537497958] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:36,635 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:36,635 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:36,635 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414528938]
[2025-05-07 17:29:36,635 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:36,635 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:36,635 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:36,636 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:36,636 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:36,636 INFO  L87              Difference]: Start difference. First operand 3061 states and 35065 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:29:40,477 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:40,477 INFO  L93              Difference]: Finished difference Result 3439 states and 43444 transitions.
[2025-05-07 17:29:40,478 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:40,478 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:29:40,478 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:43,640 INFO  L225             Difference]: With dead ends: 3439
[2025-05-07 17:29:43,640 INFO  L226             Difference]: Without dead ends: 3439
[2025-05-07 17:29:43,640 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:43,641 INFO  L437           NwaCegarLoop]: 659 mSDtfsCounter, 50 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:43,641 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1267 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-05-07 17:29:43,642 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3439 states.
[2025-05-07 17:29:50,066 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3439 to 3437.
[2025-05-07 17:29:50,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3437 states, 72 states have (on average 43.513888888888886) internal successors, (3133), 1936 states have internal predecessors, (3133), 3362 states have call successors, (3362), 36 states have call predecessors, (3362), 36 states have return successors, (36947), 1465 states have call predecessors, (36947), 3362 states have call successors, (36947)
[2025-05-07 17:29:51,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 43442 transitions.
[2025-05-07 17:29:51,559 INFO  L79                 Accepts]: Start accepts. Automaton has 3437 states and 43442 transitions. Word has length 20
[2025-05-07 17:29:51,559 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:51,559 INFO  L485      AbstractCegarLoop]: Abstraction has 3437 states and 43442 transitions.
[2025-05-07 17:29:51,559 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:29:51,559 INFO  L278                IsEmpty]: Start isEmpty. Operand 3437 states and 43442 transitions.
[2025-05-07 17:29:52,843 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:29:52,843 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:52,843 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:52,843 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-05-07 17:29:52,843 INFO  L403      AbstractCegarLoop]: === Iteration 25 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:52,846 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:52,846 INFO  L85        PathProgramCache]: Analyzing trace with hash -1706819775, now seen corresponding path program 1 times
[2025-05-07 17:29:52,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:52,846 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757193021]
[2025-05-07 17:29:52,846 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:52,846 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:52,849 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:29:52,851 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:29:52,851 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:52,851 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:52,865 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:29:52,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:52,866 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757193021]
[2025-05-07 17:29:52,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757193021] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:52,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:52,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:52,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865287808]
[2025-05-07 17:29:52,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:52,866 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:52,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:52,867 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:52,867 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:52,867 INFO  L87              Difference]: Start difference. First operand 3437 states and 43442 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:30:00,509 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:00,509 INFO  L93              Difference]: Finished difference Result 3889 states and 86301 transitions.
[2025-05-07 17:30:00,510 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:30:00,510 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:30:00,510 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:06,247 INFO  L225             Difference]: With dead ends: 3889
[2025-05-07 17:30:06,247 INFO  L226             Difference]: Without dead ends: 3889
[2025-05-07 17:30:06,247 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:30:06,248 INFO  L437           NwaCegarLoop]: 837 mSDtfsCounter, 50 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:06,248 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1615 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time]
[2025-05-07 17:30:06,249 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3889 states.
[2025-05-07 17:30:20,164 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3889 to 3813.
[2025-05-07 17:30:20,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3813 states, 80 states have (on average 33.2875) internal successors, (2663), 2136 states have internal predecessors, (2663), 3730 states have call successors, (3730), 40 states have call predecessors, (3730), 40 states have return successors, (39936), 1637 states have call predecessors, (39936), 3730 states have call successors, (39936)
[2025-05-07 17:30:21,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 46329 transitions.
[2025-05-07 17:30:21,901 INFO  L79                 Accepts]: Start accepts. Automaton has 3813 states and 46329 transitions. Word has length 20
[2025-05-07 17:30:21,901 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:21,901 INFO  L485      AbstractCegarLoop]: Abstraction has 3813 states and 46329 transitions.
[2025-05-07 17:30:21,902 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:30:21,902 INFO  L278                IsEmpty]: Start isEmpty. Operand 3813 states and 46329 transitions.
[2025-05-07 17:30:23,013 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:30:23,013 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:23,014 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:23,014 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-05-07 17:30:23,014 INFO  L403      AbstractCegarLoop]: === Iteration 26 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:23,018 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:23,018 INFO  L85        PathProgramCache]: Analyzing trace with hash -744717628, now seen corresponding path program 1 times
[2025-05-07 17:30:23,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:23,018 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226815890]
[2025-05-07 17:30:23,018 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:23,018 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:23,021 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:30:23,023 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:30:23,023 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:23,023 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:23,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:30:23,038 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:23,038 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226815890]
[2025-05-07 17:30:23,038 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226815890] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:23,038 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:23,038 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:30:23,038 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180702666]
[2025-05-07 17:30:23,038 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:23,038 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:30:23,039 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:23,039 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:30:23,039 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:23,039 INFO  L87              Difference]: Start difference. First operand 3813 states and 46329 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:30:26,976 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:26,976 INFO  L93              Difference]: Finished difference Result 4191 states and 53334 transitions.
[2025-05-07 17:30:26,977 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:30:26,977 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:30:26,977 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:30,871 INFO  L225             Difference]: With dead ends: 4191
[2025-05-07 17:30:30,871 INFO  L226             Difference]: Without dead ends: 4191
[2025-05-07 17:30:30,871 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:30,871 INFO  L437           NwaCegarLoop]: 637 mSDtfsCounter, 50 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:30,871 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1404 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-05-07 17:30:30,873 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4191 states.
[2025-05-07 17:30:39,510 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 4189.
[2025-05-07 17:30:39,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4189 states, 88 states have (on average 32.55681818181818) internal successors, (2865), 2336 states have internal predecessors, (2865), 4098 states have call successors, (4098), 44 states have call predecessors, (4098), 44 states have return successors, (46369), 1809 states have call predecessors, (46369), 4098 states have call successors, (46369)
[2025-05-07 17:30:41,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 53332 transitions.
[2025-05-07 17:30:41,575 INFO  L79                 Accepts]: Start accepts. Automaton has 4189 states and 53332 transitions. Word has length 20
[2025-05-07 17:30:41,575 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:41,575 INFO  L485      AbstractCegarLoop]: Abstraction has 4189 states and 53332 transitions.
[2025-05-07 17:30:41,575 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:30:41,575 INFO  L278                IsEmpty]: Start isEmpty. Operand 4189 states and 53332 transitions.
[2025-05-07 17:30:42,963 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:30:42,964 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:42,964 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:42,964 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-05-07 17:30:42,964 INFO  L403      AbstractCegarLoop]: === Iteration 27 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:42,966 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:42,966 INFO  L85        PathProgramCache]: Analyzing trace with hash 22789851, now seen corresponding path program 1 times
[2025-05-07 17:30:42,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:42,966 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21378451]
[2025-05-07 17:30:42,966 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:42,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:42,969 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:30:42,970 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:30:42,970 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:42,970 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:42,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:30:42,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:42,984 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21378451]
[2025-05-07 17:30:42,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21378451] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:42,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:42,985 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:30:42,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323237791]
[2025-05-07 17:30:42,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:42,985 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:30:42,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:42,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:30:42,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:42,985 INFO  L87              Difference]: Start difference. First operand 4189 states and 53332 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:30:50,126 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:50,126 INFO  L93              Difference]: Finished difference Result 4273 states and 98313 transitions.
[2025-05-07 17:30:50,127 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:30:50,127 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:30:50,127 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:56,960 INFO  L225             Difference]: With dead ends: 4273
[2025-05-07 17:30:56,960 INFO  L226             Difference]: Without dead ends: 4273
[2025-05-07 17:30:56,961 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:30:56,961 INFO  L437           NwaCegarLoop]: 806 mSDtfsCounter, 50 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:56,961 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1515 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-05-07 17:30:56,963 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4273 states.
[2025-05-07 17:31:12,829 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 4189.
[2025-05-07 17:31:12,844 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4189 states, 88 states have (on average 32.55681818181818) internal successors, (2865), 2336 states have internal predecessors, (2865), 4098 states have call successors, (4098), 44 states have call predecessors, (4098), 44 states have return successors, (45655), 1809 states have call predecessors, (45655), 4098 states have call successors, (45655)
[2025-05-07 17:31:14,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 52618 transitions.
[2025-05-07 17:31:14,935 INFO  L79                 Accepts]: Start accepts. Automaton has 4189 states and 52618 transitions. Word has length 20
[2025-05-07 17:31:14,935 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:31:14,935 INFO  L485      AbstractCegarLoop]: Abstraction has 4189 states and 52618 transitions.
[2025-05-07 17:31:14,935 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:31:14,935 INFO  L278                IsEmpty]: Start isEmpty. Operand 4189 states and 52618 transitions.
[2025-05-07 17:31:16,312 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:31:16,313 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:31:16,313 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:31:16,313 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-05-07 17:31:16,313 INFO  L403      AbstractCegarLoop]: === Iteration 28 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:31:16,317 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:31:16,317 INFO  L85        PathProgramCache]: Analyzing trace with hash -596716786, now seen corresponding path program 1 times
[2025-05-07 17:31:16,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:31:16,317 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855016923]
[2025-05-07 17:31:16,317 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:31:16,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:31:16,320 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:31:16,321 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:31:16,322 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:31:16,322 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:16,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:31:16,340 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:31:16,340 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855016923]
[2025-05-07 17:31:16,340 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855016923] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:31:16,340 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:31:16,341 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:31:16,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655516268]
[2025-05-07 17:31:16,341 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:31:16,341 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:31:16,341 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:31:16,341 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:31:16,341 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:31:16,341 INFO  L87              Difference]: Start difference. First operand 4189 states and 52618 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:31:23,586 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:31:23,586 INFO  L93              Difference]: Finished difference Result 4273 states and 97893 transitions.
[2025-05-07 17:31:23,587 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:31:23,587 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:31:23,587 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:31:31,236 INFO  L225             Difference]: With dead ends: 4273
[2025-05-07 17:31:31,236 INFO  L226             Difference]: Without dead ends: 4273
[2025-05-07 17:31:31,236 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:31:31,236 INFO  L437           NwaCegarLoop]: 777 mSDtfsCounter, 50 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:31:31,236 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1429 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-05-07 17:31:31,238 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4273 states.
[2025-05-07 17:31:44,568 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 4189.
[2025-05-07 17:31:44,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4189 states, 88 states have (on average 32.55681818181818) internal successors, (2865), 2336 states have internal predecessors, (2865), 4098 states have call successors, (4098), 44 states have call predecessors, (4098), 44 states have return successors, (45445), 1809 states have call predecessors, (45445), 4098 states have call successors, (45445)
[2025-05-07 17:31:46,555 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 52408 transitions.
[2025-05-07 17:31:46,555 INFO  L79                 Accepts]: Start accepts. Automaton has 4189 states and 52408 transitions. Word has length 20
[2025-05-07 17:31:46,555 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:31:46,556 INFO  L485      AbstractCegarLoop]: Abstraction has 4189 states and 52408 transitions.
[2025-05-07 17:31:46,556 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:31:46,556 INFO  L278                IsEmpty]: Start isEmpty. Operand 4189 states and 52408 transitions.
[2025-05-07 17:31:47,939 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:31:47,939 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:31:47,939 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:31:47,939 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-05-07 17:31:47,939 INFO  L403      AbstractCegarLoop]: === Iteration 29 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:31:47,943 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:31:47,943 INFO  L85        PathProgramCache]: Analyzing trace with hash -2064773465, now seen corresponding path program 1 times
[2025-05-07 17:31:47,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:31:47,943 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708260301]
[2025-05-07 17:31:47,943 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:31:47,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:31:47,947 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:31:47,948 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:31:47,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:31:47,948 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:47,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:31:47,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:31:47,961 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708260301]
[2025-05-07 17:31:47,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708260301] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:31:47,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:31:47,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:31:47,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755932185]
[2025-05-07 17:31:47,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:31:47,962 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:31:47,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:31:47,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:31:47,962 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:31:47,962 INFO  L87              Difference]: Start difference. First operand 4189 states and 52408 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:31:56,754 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:31:56,754 INFO  L93              Difference]: Finished difference Result 4657 states and 113251 transitions.
[2025-05-07 17:31:56,755 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:31:56,756 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:31:56,756 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:32:05,214 INFO  L225             Difference]: With dead ends: 4657
[2025-05-07 17:32:05,214 INFO  L226             Difference]: Without dead ends: 4657
[2025-05-07 17:32:05,214 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:32:05,214 INFO  L437           NwaCegarLoop]: 929 mSDtfsCounter, 50 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:32:05,214 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1738 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2025-05-07 17:32:05,216 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4657 states.
[2025-05-07 17:32:22,626 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 4565.
[2025-05-07 17:32:22,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4565 states, 96 states have (on average 32.84375) internal successors, (3153), 2536 states have internal predecessors, (3153), 4466 states have call successors, (4466), 48 states have call predecessors, (4466), 48 states have return successors, (52794), 1981 states have call predecessors, (52794), 4466 states have call successors, (52794)
[2025-05-07 17:32:25,250 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 60413 transitions.
[2025-05-07 17:32:25,250 INFO  L79                 Accepts]: Start accepts. Automaton has 4565 states and 60413 transitions. Word has length 20
[2025-05-07 17:32:25,250 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:32:25,250 INFO  L485      AbstractCegarLoop]: Abstraction has 4565 states and 60413 transitions.
[2025-05-07 17:32:25,250 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:32:25,250 INFO  L278                IsEmpty]: Start isEmpty. Operand 4565 states and 60413 transitions.
[2025-05-07 17:32:26,966 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:32:26,966 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:32:26,966 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:32:26,966 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-05-07 17:32:26,966 INFO  L403      AbstractCegarLoop]: === Iteration 30 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:32:26,967 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:32:26,967 INFO  L85        PathProgramCache]: Analyzing trace with hash 107184022, now seen corresponding path program 1 times
[2025-05-07 17:32:26,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:32:26,967 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45888920]
[2025-05-07 17:32:26,967 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:32:26,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:32:26,970 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:32:26,972 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:32:26,972 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:32:26,972 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:32:26,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:32:26,987 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:32:26,987 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45888920]
[2025-05-07 17:32:26,987 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45888920] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:32:26,987 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:32:26,987 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:32:26,987 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681774407]
[2025-05-07 17:32:26,987 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:32:26,987 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:32:26,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:32:26,988 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:32:26,988 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:32:26,988 INFO  L87              Difference]: Start difference. First operand 4565 states and 60413 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:32:35,662 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:32:35,662 INFO  L93              Difference]: Finished difference Result 4657 states and 113239 transitions.
[2025-05-07 17:32:35,663 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:32:35,663 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:32:35,663 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:32:43,959 INFO  L225             Difference]: With dead ends: 4657
[2025-05-07 17:32:43,959 INFO  L226             Difference]: Without dead ends: 4657
[2025-05-07 17:32:43,959 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:32:43,960 INFO  L437           NwaCegarLoop]: 950 mSDtfsCounter, 50 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:32:43,960 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1778 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2025-05-07 17:32:43,962 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4657 states.
[2025-05-07 17:33:00,562 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 4565.
[2025-05-07 17:33:00,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4565 states, 96 states have (on average 32.84375) internal successors, (3153), 2536 states have internal predecessors, (3153), 4466 states have call successors, (4466), 48 states have call predecessors, (4466), 48 states have return successors, (52788), 1981 states have call predecessors, (52788), 4466 states have call successors, (52788)
[2025-05-07 17:33:03,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 60407 transitions.
[2025-05-07 17:33:03,153 INFO  L79                 Accepts]: Start accepts. Automaton has 4565 states and 60407 transitions. Word has length 20
[2025-05-07 17:33:03,153 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:33:03,153 INFO  L485      AbstractCegarLoop]: Abstraction has 4565 states and 60407 transitions.
[2025-05-07 17:33:03,153 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:33:03,153 INFO  L278                IsEmpty]: Start isEmpty. Operand 4565 states and 60407 transitions.
[2025-05-07 17:33:04,863 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:33:04,863 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:33:04,863 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:33:04,863 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-05-07 17:33:04,863 INFO  L403      AbstractCegarLoop]: === Iteration 31 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:33:04,864 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:33:04,864 INFO  L85        PathProgramCache]: Analyzing trace with hash 2120154012, now seen corresponding path program 1 times
[2025-05-07 17:33:04,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:33:04,864 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482861517]
[2025-05-07 17:33:04,864 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:33:04,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:33:04,867 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:33:04,868 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:33:04,868 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:33:04,868 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:33:04,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:33:04,882 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:33:04,883 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482861517]
[2025-05-07 17:33:04,883 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482861517] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:33:04,883 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:33:04,883 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:33:04,883 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798201151]
[2025-05-07 17:33:04,883 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:33:04,883 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:33:04,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:33:04,883 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:33:04,883 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:33:04,884 INFO  L87              Difference]: Start difference. First operand 4565 states and 60407 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:33:09,708 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:33:09,708 INFO  L93              Difference]: Finished difference Result 4943 states and 68594 transitions.
[2025-05-07 17:33:09,709 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:33:09,709 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:33:09,709 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:33:15,183 INFO  L225             Difference]: With dead ends: 4943
[2025-05-07 17:33:15,183 INFO  L226             Difference]: Without dead ends: 4943
[2025-05-07 17:33:15,183 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:33:15,184 INFO  L437           NwaCegarLoop]: 638 mSDtfsCounter, 50 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:33:15,184 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1411 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-05-07 17:33:15,185 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4943 states.
[2025-05-07 17:33:25,972 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4943 to 4941.
[2025-05-07 17:33:25,992 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4941 states, 104 states have (on average 32.29807692307692) internal successors, (3359), 2736 states have internal predecessors, (3359), 4834 states have call successors, (4834), 52 states have call predecessors, (4834), 52 states have return successors, (60399), 2153 states have call predecessors, (60399), 4834 states have call successors, (60399)
[2025-05-07 17:33:29,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4941 states to 4941 states and 68592 transitions.
[2025-05-07 17:33:29,124 INFO  L79                 Accepts]: Start accepts. Automaton has 4941 states and 68592 transitions. Word has length 20
[2025-05-07 17:33:29,124 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:33:29,124 INFO  L485      AbstractCegarLoop]: Abstraction has 4941 states and 68592 transitions.
[2025-05-07 17:33:29,124 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:33:29,124 INFO  L278                IsEmpty]: Start isEmpty. Operand 4941 states and 68592 transitions.
[2025-05-07 17:33:31,187 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:33:31,187 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:33:31,187 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:33:31,187 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-05-07 17:33:31,187 INFO  L403      AbstractCegarLoop]: === Iteration 32 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:33:31,189 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:33:31,189 INFO  L85        PathProgramCache]: Analyzing trace with hash -2026812442, now seen corresponding path program 1 times
[2025-05-07 17:33:31,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:33:31,189 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906007871]
[2025-05-07 17:33:31,189 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:33:31,189 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:33:31,192 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:33:31,193 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:33:31,193 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:33:31,193 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:33:31,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:33:31,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:33:31,206 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906007871]
[2025-05-07 17:33:31,206 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906007871] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:33:31,206 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:33:31,206 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:33:31,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000789226]
[2025-05-07 17:33:31,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:33:31,207 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:33:31,207 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:33:31,207 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:33:31,207 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:33:31,207 INFO  L87              Difference]: Start difference. First operand 4941 states and 68592 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:33:41,932 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:33:41,932 INFO  L93              Difference]: Finished difference Result 5425 states and 144165 transitions.
[2025-05-07 17:33:41,933 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:33:41,933 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:33:41,933 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:33:53,990 INFO  L225             Difference]: With dead ends: 5425
[2025-05-07 17:33:53,990 INFO  L226             Difference]: Without dead ends: 5425
[2025-05-07 17:33:53,991 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:33:53,991 INFO  L437           NwaCegarLoop]: 692 mSDtfsCounter, 50 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:33:53,991 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1233 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1792 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2025-05-07 17:33:53,997 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5425 states.
[2025-05-07 17:34:16,111 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5425 to 5317.
[2025-05-07 17:34:16,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5317 states, 112 states have (on average 30.258928571428573) internal successors, (3389), 2936 states have internal predecessors, (3389), 5202 states have call successors, (5202), 56 states have call predecessors, (5202), 56 states have return successors, (67761), 2325 states have call predecessors, (67761), 5202 states have call successors, (67761)
[2025-05-07 17:34:19,797 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 76352 transitions.
[2025-05-07 17:34:19,797 INFO  L79                 Accepts]: Start accepts. Automaton has 5317 states and 76352 transitions. Word has length 20
[2025-05-07 17:34:19,797 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:34:19,797 INFO  L485      AbstractCegarLoop]: Abstraction has 5317 states and 76352 transitions.
[2025-05-07 17:34:19,797 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:34:19,798 INFO  L278                IsEmpty]: Start isEmpty. Operand 5317 states and 76352 transitions.
[2025-05-07 17:34:22,020 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:34:22,020 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:34:22,020 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:34:22,020 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-05-07 17:34:22,020 INFO  L403      AbstractCegarLoop]: === Iteration 33 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:34:22,021 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:34:22,021 INFO  L85        PathProgramCache]: Analyzing trace with hash -463638884, now seen corresponding path program 1 times
[2025-05-07 17:34:22,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:34:22,021 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254988766]
[2025-05-07 17:34:22,021 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:34:22,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:34:22,025 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:34:22,028 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:34:22,028 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:34:22,028 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:34:22,049 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:34:22,049 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:34:22,049 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254988766]
[2025-05-07 17:34:22,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254988766] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:34:22,049 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:34:22,049 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:34:22,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966073543]
[2025-05-07 17:34:22,049 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:34:22,050 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:34:22,050 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:34:22,050 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:34:22,050 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:34:22,050 INFO  L87              Difference]: Start difference. First operand 5317 states and 76352 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:34:27,506 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:34:27,506 INFO  L93              Difference]: Finished difference Result 5319 states and 76352 transitions.
[2025-05-07 17:34:27,507 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:34:27,507 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:34:27,507 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:34:34,520 INFO  L225             Difference]: With dead ends: 5319
[2025-05-07 17:34:34,520 INFO  L226             Difference]: Without dead ends: 5319
[2025-05-07 17:34:34,520 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:34:34,520 INFO  L437           NwaCegarLoop]: 637 mSDtfsCounter, 50 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:34:34,521 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1404 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-05-07 17:34:34,522 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5319 states.
[2025-05-07 17:34:45,562 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5317.
[2025-05-07 17:34:45,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5317 states, 112 states have (on average 30.258928571428573) internal successors, (3389), 2936 states have internal predecessors, (3389), 5202 states have call successors, (5202), 56 states have call predecessors, (5202), 56 states have return successors, (67759), 2325 states have call predecessors, (67759), 5202 states have call successors, (67759)
[2025-05-07 17:34:49,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 76350 transitions.
[2025-05-07 17:34:49,125 INFO  L79                 Accepts]: Start accepts. Automaton has 5317 states and 76350 transitions. Word has length 20
[2025-05-07 17:34:49,125 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:34:49,125 INFO  L485      AbstractCegarLoop]: Abstraction has 5317 states and 76350 transitions.
[2025-05-07 17:34:49,125 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:34:49,125 INFO  L278                IsEmpty]: Start isEmpty. Operand 5317 states and 76350 transitions.
[2025-05-07 17:34:51,459 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:34:51,459 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:34:51,459 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:34:51,459 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-05-07 17:34:51,459 INFO  L403      AbstractCegarLoop]: === Iteration 34 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:34:51,461 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:34:51,461 INFO  L85        PathProgramCache]: Analyzing trace with hash -1996953995, now seen corresponding path program 1 times
[2025-05-07 17:34:51,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:34:51,461 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521089514]
[2025-05-07 17:34:51,461 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:34:51,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:34:51,465 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:34:51,467 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:34:51,467 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:34:51,467 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:34:51,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:34:51,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:34:51,485 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521089514]
[2025-05-07 17:34:51,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521089514] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:34:51,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:34:51,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:34:51,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780203452]
[2025-05-07 17:34:51,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:34:51,485 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:34:51,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:34:51,486 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:34:51,486 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:34:51,486 INFO  L87              Difference]: Start difference. First operand 5317 states and 76350 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:34:58,087 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:34:58,088 INFO  L93              Difference]: Finished difference Result 5695 states and 84967 transitions.
[2025-05-07 17:34:58,088 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:34:58,088 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:34:58,088 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:35:05,733 INFO  L225             Difference]: With dead ends: 5695
[2025-05-07 17:35:05,733 INFO  L226             Difference]: Without dead ends: 5695
[2025-05-07 17:35:05,733 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:35:05,733 INFO  L437           NwaCegarLoop]: 656 mSDtfsCounter, 50 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:35:05,734 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1258 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-05-07 17:35:05,735 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5695 states.
[2025-05-07 17:35:18,854 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5695 to 5693.
[2025-05-07 17:35:18,878 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5693 states, 120 states have (on average 29.925) internal successors, (3591), 3136 states have internal predecessors, (3591), 5570 states have call successors, (5570), 60 states have call predecessors, (5570), 60 states have return successors, (75804), 2497 states have call predecessors, (75804), 5570 states have call successors, (75804)
[2025-05-07 17:35:22,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5693 states to 5693 states and 84965 transitions.
[2025-05-07 17:35:22,963 INFO  L79                 Accepts]: Start accepts. Automaton has 5693 states and 84965 transitions. Word has length 20
[2025-05-07 17:35:22,964 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:35:22,964 INFO  L485      AbstractCegarLoop]: Abstraction has 5693 states and 84965 transitions.
[2025-05-07 17:35:22,964 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:35:22,964 INFO  L278                IsEmpty]: Start isEmpty. Operand 5693 states and 84965 transitions.
[2025-05-07 17:35:25,418 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:35:25,418 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:35:25,418 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:35:25,418 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2025-05-07 17:35:25,419 INFO  L403      AbstractCegarLoop]: === Iteration 35 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:35:25,421 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:35:25,421 INFO  L85        PathProgramCache]: Analyzing trace with hash 1319084085, now seen corresponding path program 1 times
[2025-05-07 17:35:25,421 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:35:25,421 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099700718]
[2025-05-07 17:35:25,421 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:35:25,421 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:35:25,425 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:35:25,427 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:35:25,427 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:35:25,427 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:35:25,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:35:25,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:35:25,442 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099700718]
[2025-05-07 17:35:25,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099700718] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:35:25,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:35:25,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:35:25,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088599434]
[2025-05-07 17:35:25,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:35:25,443 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:35:25,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:35:25,443 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:35:25,443 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:35:25,443 INFO  L87              Difference]: Start difference. First operand 5693 states and 84965 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:35:32,008 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:35:32,009 INFO  L93              Difference]: Finished difference Result 5695 states and 84067 transitions.
[2025-05-07 17:35:32,010 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:35:32,010 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:35:32,010 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:35:39,762 INFO  L225             Difference]: With dead ends: 5695
[2025-05-07 17:35:39,762 INFO  L226             Difference]: Without dead ends: 5695
[2025-05-07 17:35:39,762 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:35:39,763 INFO  L437           NwaCegarLoop]: 664 mSDtfsCounter, 50 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:35:39,763 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1273 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-05-07 17:35:39,765 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5695 states.
[2025-05-07 17:35:53,578 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5695 to 5693.
[2025-05-07 17:35:53,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5693 states, 120 states have (on average 29.875) internal successors, (3585), 3136 states have internal predecessors, (3585), 5570 states have call successors, (5570), 60 states have call predecessors, (5570), 60 states have return successors, (74910), 2497 states have call predecessors, (74910), 5570 states have call successors, (74910)
[2025-05-07 17:35:58,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5693 states to 5693 states and 84065 transitions.
[2025-05-07 17:35:58,002 INFO  L79                 Accepts]: Start accepts. Automaton has 5693 states and 84065 transitions. Word has length 20
[2025-05-07 17:35:58,002 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:35:58,002 INFO  L485      AbstractCegarLoop]: Abstraction has 5693 states and 84065 transitions.
[2025-05-07 17:35:58,002 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:35:58,002 INFO  L278                IsEmpty]: Start isEmpty. Operand 5693 states and 84065 transitions.
[2025-05-07 17:36:00,484 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:36:00,484 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:36:00,484 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:36:00,484 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2025-05-07 17:36:00,484 INFO  L403      AbstractCegarLoop]: === Iteration 36 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:36:00,486 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:36:00,486 INFO  L85        PathProgramCache]: Analyzing trace with hash 1747665253, now seen corresponding path program 1 times
[2025-05-07 17:36:00,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:36:00,486 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514297489]
[2025-05-07 17:36:00,486 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:36:00,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:36:00,490 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:36:00,492 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:36:00,492 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:36:00,492 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:36:00,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:36:00,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:36:00,508 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514297489]
[2025-05-07 17:36:00,509 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514297489] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:36:00,509 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:36:00,509 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:36:00,509 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89259230]
[2025-05-07 17:36:00,509 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:36:00,509 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:36:00,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:36:00,509 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:36:00,509 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:36:00,509 INFO  L87              Difference]: Start difference. First operand 5693 states and 84065 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:36:06,301 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:36:06,301 INFO  L93              Difference]: Finished difference Result 5695 states and 82233 transitions.
[2025-05-07 17:36:06,302 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:36:06,302 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:36:06,302 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:36:13,406 INFO  L225             Difference]: With dead ends: 5695
[2025-05-07 17:36:13,406 INFO  L226             Difference]: Without dead ends: 5695
[2025-05-07 17:36:13,406 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:36:13,406 INFO  L437           NwaCegarLoop]: 637 mSDtfsCounter, 50 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:36:13,406 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1402 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-05-07 17:36:13,408 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5695 states.
[2025-05-07 17:36:27,096 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5695 to 5693.
[2025-05-07 17:36:27,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5693 states, 120 states have (on average 29.475) internal successors, (3537), 3136 states have internal predecessors, (3537), 5570 states have call successors, (5570), 60 states have call predecessors, (5570), 60 states have return successors, (73124), 2497 states have call predecessors, (73124), 5570 states have call successors, (73124)
[2025-05-07 17:36:31,255 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5693 states to 5693 states and 82231 transitions.
[2025-05-07 17:36:31,255 INFO  L79                 Accepts]: Start accepts. Automaton has 5693 states and 82231 transitions. Word has length 20
[2025-05-07 17:36:31,255 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:36:31,255 INFO  L485      AbstractCegarLoop]: Abstraction has 5693 states and 82231 transitions.
[2025-05-07 17:36:31,255 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:36:31,255 INFO  L278                IsEmpty]: Start isEmpty. Operand 5693 states and 82231 transitions.
[2025-05-07 17:36:33,829 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:36:33,829 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:36:33,829 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:36:33,829 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2025-05-07 17:36:33,829 INFO  L403      AbstractCegarLoop]: === Iteration 37 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:36:33,830 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:36:33,830 INFO  L85        PathProgramCache]: Analyzing trace with hash -523345398, now seen corresponding path program 1 times
[2025-05-07 17:36:33,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:36:33,830 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937538915]
[2025-05-07 17:36:33,830 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:36:33,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:36:33,833 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:36:33,835 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:36:33,835 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:36:33,835 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:36:33,851 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:36:33,851 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:36:33,851 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937538915]
[2025-05-07 17:36:33,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937538915] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:36:33,851 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:36:33,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:36:33,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548861091]
[2025-05-07 17:36:33,851 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:36:33,852 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:36:33,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:36:33,852 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:36:33,852 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:36:33,852 INFO  L87              Difference]: Start difference. First operand 5693 states and 82231 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:36:47,027 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:36:47,027 INFO  L93              Difference]: Finished difference Result 6193 states and 172139 transitions.
[2025-05-07 17:36:47,028 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:36:47,028 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:36:47,029 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:37:02,070 INFO  L225             Difference]: With dead ends: 6193
[2025-05-07 17:37:02,070 INFO  L226             Difference]: Without dead ends: 6193
[2025-05-07 17:37:02,070 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:37:02,071 INFO  L437           NwaCegarLoop]: 621 mSDtfsCounter, 51 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:37:02,071 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1085 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2025-05-07 17:37:02,072 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6193 states.
[2025-05-07 17:37:29,885 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6193 to 6069.
[2025-05-07 17:37:29,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6069 states, 128 states have (on average 29.1640625) internal successors, (3733), 3336 states have internal predecessors, (3733), 5938 states have call successors, (5938), 64 states have call predecessors, (5938), 64 states have return successors, (81204), 2669 states have call predecessors, (81204), 5938 states have call successors, (81204)
[2025-05-07 17:37:34,763 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 90875 transitions.
[2025-05-07 17:37:34,763 INFO  L79                 Accepts]: Start accepts. Automaton has 6069 states and 90875 transitions. Word has length 20
[2025-05-07 17:37:34,763 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:37:34,763 INFO  L485      AbstractCegarLoop]: Abstraction has 6069 states and 90875 transitions.
[2025-05-07 17:37:34,763 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:37:34,763 INFO  L278                IsEmpty]: Start isEmpty. Operand 6069 states and 90875 transitions.
[2025-05-07 17:37:37,532 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:37:37,532 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:37:37,532 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:37:37,532 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2025-05-07 17:37:37,532 INFO  L403      AbstractCegarLoop]: === Iteration 38 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:37:37,535 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:37:37,535 INFO  L85        PathProgramCache]: Analyzing trace with hash -167637200, now seen corresponding path program 1 times
[2025-05-07 17:37:37,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:37:37,535 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508195187]
[2025-05-07 17:37:37,535 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:37:37,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:37:37,538 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:37:37,540 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:37:37,540 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:37:37,540 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:37:37,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:37:37,554 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:37:37,554 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508195187]
[2025-05-07 17:37:37,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508195187] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:37:37,554 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:37:37,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:37:37,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944102242]
[2025-05-07 17:37:37,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:37:37,554 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:37:37,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:37:37,554 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:37:37,554 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:37:37,555 INFO  L87              Difference]: Start difference. First operand 6069 states and 90875 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:37:53,096 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:37:53,096 INFO  L93              Difference]: Finished difference Result 6577 states and 191545 transitions.
[2025-05-07 17:37:53,097 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:37:53,097 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:37:53,097 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:38:12,301 INFO  L225             Difference]: With dead ends: 6577
[2025-05-07 17:38:12,301 INFO  L226             Difference]: Without dead ends: 6577
[2025-05-07 17:38:12,301 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:38:12,302 INFO  L437           NwaCegarLoop]: 910 mSDtfsCounter, 50 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:38:12,302 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1715 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time]
[2025-05-07 17:38:12,304 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6577 states.
[2025-05-07 17:38:44,169 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 6445.
[2025-05-07 17:38:44,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6445 states, 136 states have (on average 28.71323529411765) internal successors, (3905), 3536 states have internal predecessors, (3905), 6306 states have call successors, (6306), 68 states have call predecessors, (6306), 68 states have return successors, (90635), 2841 states have call predecessors, (90635), 6306 states have call successors, (90635)
[2025-05-07 17:38:49,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6445 states to 6445 states and 100846 transitions.
[2025-05-07 17:38:49,831 INFO  L79                 Accepts]: Start accepts. Automaton has 6445 states and 100846 transitions. Word has length 20
[2025-05-07 17:38:49,831 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:38:49,831 INFO  L485      AbstractCegarLoop]: Abstraction has 6445 states and 100846 transitions.
[2025-05-07 17:38:49,831 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:38:49,831 INFO  L278                IsEmpty]: Start isEmpty. Operand 6445 states and 100846 transitions.
[2025-05-07 17:38:53,024 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:38:53,024 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:38:53,024 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:38:53,024 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-05-07 17:38:53,025 INFO  L403      AbstractCegarLoop]: === Iteration 39 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:38:53,034 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:38:53,034 INFO  L85        PathProgramCache]: Analyzing trace with hash 1895666095, now seen corresponding path program 1 times
[2025-05-07 17:38:53,034 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:38:53,034 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181056960]
[2025-05-07 17:38:53,034 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:38:53,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:38:53,037 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:38:53,039 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:38:53,039 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:38:53,039 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:38:53,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:38:53,172 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:38:53,172 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181056960]
[2025-05-07 17:38:53,172 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181056960] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:38:53,172 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:38:53,172 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:38:53,172 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362375949]
[2025-05-07 17:38:53,172 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:38:53,172 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:38:53,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:38:53,172 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:38:53,172 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:38:53,172 INFO  L87              Difference]: Start difference. First operand 6445 states and 100846 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:39:00,776 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:39:00,776 INFO  L93              Difference]: Finished difference Result 6447 states and 100398 transitions.
[2025-05-07 17:39:00,776 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:39:00,777 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:39:00,777 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:39:09,540 INFO  L225             Difference]: With dead ends: 6447
[2025-05-07 17:39:09,541 INFO  L226             Difference]: Without dead ends: 6447
[2025-05-07 17:39:09,541 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:39:09,541 INFO  L437           NwaCegarLoop]: 658 mSDtfsCounter, 50 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:39:09,541 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1262 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-05-07 17:39:09,543 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6447 states.
[2025-05-07 17:39:24,612 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6447 to 6445.
[2025-05-07 17:39:24,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6445 states, 136 states have (on average 28.698529411764707) internal successors, (3903), 3536 states have internal predecessors, (3903), 6306 states have call successors, (6306), 68 states have call predecessors, (6306), 68 states have return successors, (90187), 2841 states have call predecessors, (90187), 6306 states have call successors, (90187)
[2025-05-07 17:39:30,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6445 states to 6445 states and 100396 transitions.
[2025-05-07 17:39:30,140 INFO  L79                 Accepts]: Start accepts. Automaton has 6445 states and 100396 transitions. Word has length 20
[2025-05-07 17:39:30,140 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:39:30,140 INFO  L485      AbstractCegarLoop]: Abstraction has 6445 states and 100396 transitions.
[2025-05-07 17:39:30,140 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:39:30,140 INFO  L278                IsEmpty]: Start isEmpty. Operand 6445 states and 100396 transitions.
[2025-05-07 17:39:34,165 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:39:34,165 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:39:34,165 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:39:34,165 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-05-07 17:39:34,165 INFO  L403      AbstractCegarLoop]: === Iteration 40 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:39:34,168 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:39:34,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 451869437, now seen corresponding path program 1 times
[2025-05-07 17:39:34,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:39:34,168 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223288493]
[2025-05-07 17:39:34,168 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:39:34,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:39:34,171 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:39:34,173 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:39:34,173 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:39:34,173 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:39:34,187 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:39:34,187 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:39:34,187 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223288493]
[2025-05-07 17:39:34,187 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223288493] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:39:34,187 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:39:34,187 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:39:34,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848491597]
[2025-05-07 17:39:34,187 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:39:34,187 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:39:34,188 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:39:34,188 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:39:34,188 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:39:34,188 INFO  L87              Difference]: Start difference. First operand 6445 states and 100396 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:39:47,717 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:39:47,717 INFO  L93              Difference]: Finished difference Result 6577 states and 190527 transitions.
[2025-05-07 17:39:47,717 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:39:47,717 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:39:47,718 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:40:03,794 INFO  L225             Difference]: With dead ends: 6577
[2025-05-07 17:40:03,794 INFO  L226             Difference]: Without dead ends: 6577
[2025-05-07 17:40:03,794 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:40:03,795 INFO  L437           NwaCegarLoop]: 832 mSDtfsCounter, 50 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:40:03,795 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1516 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2025-05-07 17:40:03,796 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6577 states.
[2025-05-07 17:40:31,948 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 6445.
[2025-05-07 17:40:31,975 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6445 states, 136 states have (on average 28.698529411764707) internal successors, (3903), 3536 states have internal predecessors, (3903), 6306 states have call successors, (6306), 68 states have call predecessors, (6306), 68 states have return successors, (90127), 2841 states have call predecessors, (90127), 6306 states have call successors, (90127)
[2025-05-07 17:40:37,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6445 states to 6445 states and 100336 transitions.
[2025-05-07 17:40:37,626 INFO  L79                 Accepts]: Start accepts. Automaton has 6445 states and 100336 transitions. Word has length 20
[2025-05-07 17:40:37,626 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:40:37,626 INFO  L485      AbstractCegarLoop]: Abstraction has 6445 states and 100336 transitions.
[2025-05-07 17:40:37,627 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:40:37,627 INFO  L278                IsEmpty]: Start isEmpty. Operand 6445 states and 100336 transitions.
[2025-05-07 17:40:41,593 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:40:41,594 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:40:41,594 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:40:41,594 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2025-05-07 17:40:41,594 INFO  L403      AbstractCegarLoop]: === Iteration 41 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:40:41,594 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:40:41,594 INFO  L85        PathProgramCache]: Analyzing trace with hash -1277740189, now seen corresponding path program 1 times
[2025-05-07 17:40:41,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:40:41,594 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847869006]
[2025-05-07 17:40:41,594 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:40:41,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:40:41,598 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:40:41,599 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:40:41,599 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:40:41,599 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:40:41,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:40:41,614 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:40:41,614 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847869006]
[2025-05-07 17:40:41,614 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847869006] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:40:41,614 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:40:41,614 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:40:41,614 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771162329]
[2025-05-07 17:40:41,614 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:40:41,614 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:40:41,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:40:41,615 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:40:41,615 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:40:41,615 INFO  L87              Difference]: Start difference. First operand 6445 states and 100336 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:40:55,553 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:40:55,554 INFO  L93              Difference]: Finished difference Result 6577 states and 190419 transitions.
[2025-05-07 17:40:55,554 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:40:55,554 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:40:55,554 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:41:12,287 INFO  L225             Difference]: With dead ends: 6577
[2025-05-07 17:41:12,287 INFO  L226             Difference]: Without dead ends: 6577
[2025-05-07 17:41:12,287 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:41:12,287 INFO  L437           NwaCegarLoop]: 691 mSDtfsCounter, 51 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:41:12,288 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1239 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2025-05-07 17:41:12,289 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6577 states.
[2025-05-07 17:41:39,102 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 6445.
[2025-05-07 17:41:39,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6445 states, 136 states have (on average 28.698529411764707) internal successors, (3903), 3536 states have internal predecessors, (3903), 6306 states have call successors, (6306), 68 states have call predecessors, (6306), 68 states have return successors, (90073), 2841 states have call predecessors, (90073), 6306 states have call successors, (90073)
[2025-05-07 17:41:44,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6445 states to 6445 states and 100282 transitions.
[2025-05-07 17:41:44,704 INFO  L79                 Accepts]: Start accepts. Automaton has 6445 states and 100282 transitions. Word has length 20
[2025-05-07 17:41:44,704 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:41:44,704 INFO  L485      AbstractCegarLoop]: Abstraction has 6445 states and 100282 transitions.
[2025-05-07 17:41:44,704 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:41:44,704 INFO  L278                IsEmpty]: Start isEmpty. Operand 6445 states and 100282 transitions.
[2025-05-07 17:41:49,015 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:41:49,015 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:41:49,015 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:41:49,016 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2025-05-07 17:41:49,016 INFO  L403      AbstractCegarLoop]: === Iteration 42 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:41:49,016 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:41:49,016 INFO  L85        PathProgramCache]: Analyzing trace with hash 1621433974, now seen corresponding path program 1 times
[2025-05-07 17:41:49,016 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:41:49,016 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920474050]
[2025-05-07 17:41:49,016 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:41:49,016 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:41:49,019 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:41:49,021 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:41:49,021 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:41:49,021 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:41:49,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:41:49,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:41:49,034 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920474050]
[2025-05-07 17:41:49,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920474050] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:41:49,034 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:41:49,034 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:41:49,034 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595796080]
[2025-05-07 17:41:49,034 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:41:49,034 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:41:49,034 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:41:49,035 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:41:49,035 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:41:49,035 INFO  L87              Difference]: Start difference. First operand 6445 states and 100282 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:42:04,876 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:42:04,876 INFO  L93              Difference]: Finished difference Result 6961 states and 210843 transitions.
[2025-05-07 17:42:04,877 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:42:04,877 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:42:04,877 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:42:23,471 INFO  L225             Difference]: With dead ends: 6961
[2025-05-07 17:42:23,471 INFO  L226             Difference]: Without dead ends: 6961
[2025-05-07 17:42:23,472 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:42:23,472 INFO  L437           NwaCegarLoop]: 747 mSDtfsCounter, 50 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:42:23,472 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1344 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time]
[2025-05-07 17:42:23,474 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6961 states.
[2025-05-07 17:42:59,319 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6961 to 6821.
[2025-05-07 17:42:59,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6821 states, 144 states have (on average 28.618055555555557) internal successors, (4121), 3736 states have internal predecessors, (4121), 6674 states have call successors, (6674), 72 states have call predecessors, (6674), 72 states have return successors, (99990), 3013 states have call predecessors, (99990), 6674 states have call successors, (99990)
[2025-05-07 17:43:05,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 110785 transitions.
[2025-05-07 17:43:05,762 INFO  L79                 Accepts]: Start accepts. Automaton has 6821 states and 110785 transitions. Word has length 20
[2025-05-07 17:43:05,762 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:43:05,762 INFO  L485      AbstractCegarLoop]: Abstraction has 6821 states and 110785 transitions.
[2025-05-07 17:43:05,762 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:43:05,762 INFO  L278                IsEmpty]: Start isEmpty. Operand 6821 states and 110785 transitions.
[2025-05-07 17:43:09,931 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:43:09,931 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:43:09,931 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:43:09,931 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2025-05-07 17:43:09,931 INFO  L403      AbstractCegarLoop]: === Iteration 43 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:43:09,935 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:43:09,935 INFO  L85        PathProgramCache]: Analyzing trace with hash -1255970626, now seen corresponding path program 1 times
[2025-05-07 17:43:09,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:43:09,935 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051757397]
[2025-05-07 17:43:09,935 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:43:09,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:43:09,939 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:43:09,941 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:43:09,941 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:43:09,941 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:43:09,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:43:09,954 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:43:09,954 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051757397]
[2025-05-07 17:43:09,954 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051757397] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:43:09,954 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:43:09,954 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:43:09,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290628207]
[2025-05-07 17:43:09,954 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:43:09,954 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:43:09,954 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:43:09,955 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:43:09,955 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:43:09,955 INFO  L87              Difference]: Start difference. First operand 6821 states and 110785 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:43:25,383 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:43:25,384 INFO  L93              Difference]: Finished difference Result 6961 states and 210819 transitions.
[2025-05-07 17:43:25,385 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:43:25,385 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:43:25,385 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:43:44,643 INFO  L225             Difference]: With dead ends: 6961
[2025-05-07 17:43:44,643 INFO  L226             Difference]: Without dead ends: 6961
[2025-05-07 17:43:44,644 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:43:44,644 INFO  L437           NwaCegarLoop]: 741 mSDtfsCounter, 50 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:43:44,644 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1326 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-05-07 17:43:44,646 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6961 states.
[2025-05-07 17:44:19,331 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6961 to 6821.
[2025-05-07 17:44:19,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6821 states, 144 states have (on average 28.618055555555557) internal successors, (4121), 3736 states have internal predecessors, (4121), 6674 states have call successors, (6674), 72 states have call predecessors, (6674), 72 states have return successors, (99978), 3013 states have call predecessors, (99978), 6674 states have call successors, (99978)
[2025-05-07 17:44:25,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 110773 transitions.
[2025-05-07 17:44:25,422 INFO  L79                 Accepts]: Start accepts. Automaton has 6821 states and 110773 transitions. Word has length 20
[2025-05-07 17:44:25,422 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:44:25,423 INFO  L485      AbstractCegarLoop]: Abstraction has 6821 states and 110773 transitions.
[2025-05-07 17:44:25,423 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:44:25,423 INFO  L278                IsEmpty]: Start isEmpty. Operand 6821 states and 110773 transitions.
[2025-05-07 17:44:30,093 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:44:30,093 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:44:30,093 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:44:30,093 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2025-05-07 17:44:30,094 INFO  L403      AbstractCegarLoop]: === Iteration 44 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:44:30,094 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:44:30,094 INFO  L85        PathProgramCache]: Analyzing trace with hash -1280723565, now seen corresponding path program 1 times
[2025-05-07 17:44:30,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:44:30,094 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951002799]
[2025-05-07 17:44:30,094 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:44:30,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:44:30,098 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:44:30,099 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:44:30,100 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:44:30,100 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:44:30,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:44:30,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:44:30,116 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951002799]
[2025-05-07 17:44:30,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951002799] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:44:30,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:44:30,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:44:30,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996275118]
[2025-05-07 17:44:30,117 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:44:30,117 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:44:30,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:44:30,117 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:44:30,117 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:44:30,117 INFO  L87              Difference]: Start difference. First operand 6821 states and 110773 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:44:47,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:44:47,129 INFO  L93              Difference]: Finished difference Result 7345 states and 232015 transitions.
[2025-05-07 17:44:47,130 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:44:47,130 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:44:47,130 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:45:09,367 INFO  L225             Difference]: With dead ends: 7345
[2025-05-07 17:45:09,367 INFO  L226             Difference]: Without dead ends: 7345
[2025-05-07 17:45:09,367 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:45:09,367 INFO  L437           NwaCegarLoop]: 828 mSDtfsCounter, 50 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:45:09,367 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1551 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-05-07 17:45:09,369 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7345 states.
[2025-05-07 17:45:43,748 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7345 to 7197.
[2025-05-07 17:45:43,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7197 states, 152 states have (on average 28.49342105263158) internal successors, (4331), 3936 states have internal predecessors, (4331), 7042 states have call successors, (7042), 76 states have call predecessors, (7042), 76 states have return successors, (110285), 3185 states have call predecessors, (110285), 7042 states have call successors, (110285)
[2025-05-07 17:45:51,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7197 states to 7197 states and 121658 transitions.
[2025-05-07 17:45:51,158 INFO  L79                 Accepts]: Start accepts. Automaton has 7197 states and 121658 transitions. Word has length 20
[2025-05-07 17:45:51,158 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:45:51,158 INFO  L485      AbstractCegarLoop]: Abstraction has 7197 states and 121658 transitions.
[2025-05-07 17:45:51,158 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:45:51,158 INFO  L278                IsEmpty]: Start isEmpty. Operand 7197 states and 121658 transitions.
[2025-05-07 17:45:55,906 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:45:55,906 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:45:55,906 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:45:55,906 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2025-05-07 17:45:55,906 INFO  L403      AbstractCegarLoop]: === Iteration 45 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:45:55,907 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:45:55,907 INFO  L85        PathProgramCache]: Analyzing trace with hash -1900230202, now seen corresponding path program 1 times
[2025-05-07 17:45:55,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:45:55,907 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202259966]
[2025-05-07 17:45:55,908 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:45:55,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:45:55,910 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:45:55,912 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:45:55,912 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:45:55,912 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:45:55,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:45:55,924 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:45:55,924 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202259966]
[2025-05-07 17:45:55,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202259966] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:45:55,924 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:45:55,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:45:55,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776635951]
[2025-05-07 17:45:55,924 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:45:55,924 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:45:55,924 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:45:55,925 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:45:55,925 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:45:55,925 INFO  L87              Difference]: Start difference. First operand 7197 states and 121658 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:46:14,982 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:46:14,982 INFO  L93              Difference]: Finished difference Result 7729 states and 251903 transitions.
[2025-05-07 17:46:14,983 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:46:14,983 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:46:14,983 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:46:39,571 INFO  L225             Difference]: With dead ends: 7729
[2025-05-07 17:46:39,571 INFO  L226             Difference]: Without dead ends: 7729
[2025-05-07 17:46:39,571 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:46:39,571 INFO  L437           NwaCegarLoop]: 784 mSDtfsCounter, 50 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:46:39,571 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1389 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2025-05-07 17:46:39,574 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7729 states.
[2025-05-07 17:47:26,318 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7729 to 7573.
[2025-05-07 17:47:26,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7573 states, 160 states have (on average 28.28125) internal successors, (4525), 4136 states have internal predecessors, (4525), 7410 states have call successors, (7410), 80 states have call predecessors, (7410), 80 states have return successors, (119946), 3357 states have call predecessors, (119946), 7410 states have call successors, (119946)
[2025-05-07 17:47:34,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 131881 transitions.
[2025-05-07 17:47:34,082 INFO  L79                 Accepts]: Start accepts. Automaton has 7573 states and 131881 transitions. Word has length 20
[2025-05-07 17:47:34,082 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:47:34,082 INFO  L485      AbstractCegarLoop]: Abstraction has 7573 states and 131881 transitions.
[2025-05-07 17:47:34,082 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:47:34,082 INFO  L278                IsEmpty]: Start isEmpty. Operand 7573 states and 131881 transitions.
[2025-05-07 17:47:39,218 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:47:39,219 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:47:39,219 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:47:39,219 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2025-05-07 17:47:39,219 INFO  L403      AbstractCegarLoop]: === Iteration 46 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:47:39,219 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:47:39,220 INFO  L85        PathProgramCache]: Analyzing trace with hash -1889483422, now seen corresponding path program 1 times
[2025-05-07 17:47:39,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:47:39,220 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119991417]
[2025-05-07 17:47:39,220 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:47:39,220 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:47:39,223 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:47:39,225 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:47:39,225 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:47:39,225 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:47:39,242 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:47:39,242 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:47:39,242 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119991417]
[2025-05-07 17:47:39,243 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119991417] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:47:39,243 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:47:39,243 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:47:39,243 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956116476]
[2025-05-07 17:47:39,243 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:47:39,243 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:47:39,243 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:47:39,243 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:47:39,243 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:47:39,243 INFO  L87              Difference]: Start difference. First operand 7573 states and 131881 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:47:58,451 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:47:58,451 INFO  L93              Difference]: Finished difference Result 7729 states and 249775 transitions.
[2025-05-07 17:47:58,452 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:47:58,452 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:47:58,452 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:48:23,964 INFO  L225             Difference]: With dead ends: 7729
[2025-05-07 17:48:23,964 INFO  L226             Difference]: Without dead ends: 7729
[2025-05-07 17:48:23,965 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:48:23,965 INFO  L437           NwaCegarLoop]: 785 mSDtfsCounter, 50 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:48:23,965 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1447 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2025-05-07 17:48:23,967 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7729 states.
[2025-05-07 17:49:00,619 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7729 to 7573.
[2025-05-07 17:49:00,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7573 states, 160 states have (on average 28.08125) internal successors, (4493), 4136 states have internal predecessors, (4493), 7410 states have call successors, (7410), 80 states have call predecessors, (7410), 80 states have return successors, (118898), 3357 states have call predecessors, (118898), 7410 states have call successors, (118898)
[2025-05-07 17:49:08,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 130801 transitions.
[2025-05-07 17:49:08,841 INFO  L79                 Accepts]: Start accepts. Automaton has 7573 states and 130801 transitions. Word has length 20
[2025-05-07 17:49:08,841 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:49:08,841 INFO  L485      AbstractCegarLoop]: Abstraction has 7573 states and 130801 transitions.
[2025-05-07 17:49:08,841 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:49:08,841 INFO  L278                IsEmpty]: Start isEmpty. Operand 7573 states and 130801 transitions.
[2025-05-07 17:49:14,199 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:49:14,200 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:49:14,200 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:49:14,200 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2025-05-07 17:49:14,200 INFO  L403      AbstractCegarLoop]: === Iteration 47 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:49:14,201 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:49:14,201 INFO  L85        PathProgramCache]: Analyzing trace with hash 405018937, now seen corresponding path program 1 times
[2025-05-07 17:49:14,201 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:49:14,201 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853249723]
[2025-05-07 17:49:14,201 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:49:14,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:49:14,204 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:49:14,206 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:49:14,206 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:49:14,206 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:49:14,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:49:14,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:49:14,218 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853249723]
[2025-05-07 17:49:14,218 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853249723] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:49:14,218 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:49:14,218 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:49:14,218 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967193436]
[2025-05-07 17:49:14,219 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:49:14,219 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:49:14,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:49:14,219 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:49:14,219 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:49:14,219 INFO  L87              Difference]: Start difference. First operand 7573 states and 130801 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:49:34,678 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:49:34,678 INFO  L93              Difference]: Finished difference Result 8113 states and 272875 transitions.
[2025-05-07 17:49:34,679 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:49:34,679 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:49:34,679 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:50:02,131 INFO  L225             Difference]: With dead ends: 8113
[2025-05-07 17:50:02,132 INFO  L226             Difference]: Without dead ends: 8113
[2025-05-07 17:50:02,132 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:50:02,132 INFO  L437           NwaCegarLoop]: 828 mSDtfsCounter, 50 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:50:02,132 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1505 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2025-05-07 17:50:02,134 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8113 states.
