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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:14,440 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:14,544 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d6b69a-ff0a-4519-b0cb-39559f3e3608/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:14,551 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:14,551 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:14,589 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:14,589 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:14,590 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:14,591 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:14,591 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:14,592 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:14,592 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:14,593 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:14,593 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:14,593 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:14,593 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:14,594 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:14,595 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:14,595 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:14,595 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:14,595 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:14,595 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:14,595 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:14,595 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:14,595 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:14,596 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:14,596 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:14,940 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:14,953 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:14,956 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:14,960 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:14,960 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:14,963 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d6b69a-ff0a-4519-b0cb-39559f3e3608/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-046.smt2
[2025-04-28 21:21:14,965 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:14,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:15,173 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d6b69a-ff0a-4519-b0cb-39559f3e3608/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-046.smt2
[2025-04-28 21:21:15,179 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:15,181 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:15,183 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:15,183 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:15,183 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:15,186 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:15" (1/1) ...
[2025-04-28 21:21:15,214 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:15 Unit
[2025-04-28 21:21:15,214 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:15,217 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:15,217 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:15,217 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:15,235 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:15" (1/1) ...
[2025-04-28 21:21:15,235 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:15" (1/1) ...
[2025-04-28 21:21:15,259 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:15" (1/1) ...
[2025-04-28 21:21:15,259 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:15" (1/1) ...
[2025-04-28 21:21:15,261 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:15" (1/1) ...
[2025-04-28 21:21:15,264 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:15" (1/1) ...
[2025-04-28 21:21:15,266 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:15" (1/1) ...
[2025-04-28 21:21:15,267 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:15" (1/1) ...
[2025-04-28 21:21:15,268 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:15" (1/1) ...
[2025-04-28 21:21:15,277 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:15,278 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:15,278 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:15,278 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:15,279 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:15" (1/1) ...
[2025-04-28 21:21:15,282 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:15,299 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:15,316 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:15,322 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:15,334 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:15,334 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:15,334 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:15,334 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure state given in one single declaration
[2025-04-28 21:21:15,335 INFO  L130     BoogieDeclarations]: Found specification of procedure state
[2025-04-28 21:21:15,335 INFO  L138     BoogieDeclarations]: Found implementation of procedure state
[2025-04-28 21:21:15,335 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:15,336 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:15,336 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:15,378 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:15,381 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:15,487 INFO  L?                        ?]: Removed 2 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:15,487 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:15,501 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:15,501 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:15,502 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:15 BoogieIcfgContainer
[2025-04-28 21:21:15,502 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:15,507 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:15,507 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:15,511 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:15,511 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:15" (1/3) ...
[2025-04-28 21:21:15,512 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfe119b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:15, skipping insertion in model container
[2025-04-28 21:21:15,513 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:15" (2/3) ...
[2025-04-28 21:21:15,513 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfe119b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:15, skipping insertion in model container
[2025-04-28 21:21:15,513 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:15" (3/3) ...
[2025-04-28 21:21:15,515 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:15,532 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:15,536 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 3 procedures, 13 locations, 17 edges, 3 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:15,589 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:15,601 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;@34523906, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:15,602 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:15,606 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 13 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 8 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-04-28 21:21:15,614 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:15,614 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:15,615 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:15,615 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:15,621 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:15,621 INFO  L85        PathProgramCache]: Analyzing trace with hash -597537630, now seen corresponding path program 1 times
[2025-04-28 21:21:15,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:15,633 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100145969]
[2025-04-28 21:21:15,633 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:15,634 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:15,669 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:15,677 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:15,678 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:15,678 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:15,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:15,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:15,854 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100145969]
[2025-04-28 21:21:15,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100145969] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:15,855 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:15,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:15,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064406333]
[2025-04-28 21:21:15,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:15,870 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:15,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:15,899 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:15,900 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:15,902 INFO  L87              Difference]: Start difference. First operand  has 13 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 8 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:15,956 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:15,956 INFO  L93              Difference]: Finished difference Result 13 states and 14 transitions.
[2025-04-28 21:21:15,958 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:15,959 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 9
[2025-04-28 21:21:15,960 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:15,967 INFO  L225             Difference]: With dead ends: 13
[2025-04-28 21:21:15,967 INFO  L226             Difference]: Without dead ends: 13
[2025-04-28 21:21:15,969 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:15,972 INFO  L437           NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:15,973 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:15,990 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2025-04-28 21:21:16,019 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13.
[2025-04-28 21:21:16,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:16,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions.
[2025-04-28 21:21:16,027 INFO  L79                 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9
[2025-04-28 21:21:16,027 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:16,027 INFO  L485      AbstractCegarLoop]: Abstraction has 13 states and 14 transitions.
[2025-04-28 21:21:16,028 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:16,028 INFO  L278                IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions.
[2025-04-28 21:21:16,031 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-04-28 21:21:16,031 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:16,032 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:16,033 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:16,033 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:16,034 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:16,034 INFO  L85        PathProgramCache]: Analyzing trace with hash 1530833734, now seen corresponding path program 1 times
[2025-04-28 21:21:16,034 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:16,034 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276515804]
[2025-04-28 21:21:16,034 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:16,035 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:16,050 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-04-28 21:21:16,056 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-04-28 21:21:16,056 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:16,056 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:16,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:16,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:16,321 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276515804]
[2025-04-28 21:21:16,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276515804] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:16,321 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611146522]
[2025-04-28 21:21:16,321 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:16,321 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:16,323 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:16,330 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:16,333 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:16,376 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-04-28 21:21:16,391 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-04-28 21:21:16,391 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:16,391 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:16,393 INFO  L256         TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:16,398 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:16,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:16,710 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:17,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:17,211 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611146522] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:17,211 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:17,211 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8
[2025-04-28 21:21:17,212 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236689733]
[2025-04-28 21:21:17,212 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:17,213 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:17,213 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:17,215 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:17,215 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:17,216 INFO  L87              Difference]: Start difference. First operand 13 states and 14 transitions. Second operand  has 8 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4)
[2025-04-28 21:21:17,275 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:17,276 INFO  L93              Difference]: Finished difference Result 15 states and 16 transitions.
[2025-04-28 21:21:17,277 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:17,278 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 13
[2025-04-28 21:21:17,278 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:17,279 INFO  L225             Difference]: With dead ends: 15
[2025-04-28 21:21:17,279 INFO  L226             Difference]: Without dead ends: 15
[2025-04-28 21:21:17,279 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:17,280 INFO  L437           NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:17,280 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 39 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:17,284 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2025-04-28 21:21:17,286 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2025-04-28 21:21:17,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 8 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:17,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions.
[2025-04-28 21:21:17,290 INFO  L79                 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13
[2025-04-28 21:21:17,290 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:17,290 INFO  L485      AbstractCegarLoop]: Abstraction has 15 states and 16 transitions.
[2025-04-28 21:21:17,290 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4)
[2025-04-28 21:21:17,290 INFO  L278                IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions.
[2025-04-28 21:21:17,291 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:17,291 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:17,291 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:17,298 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:17,492 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:17,492 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:17,493 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:17,493 INFO  L85        PathProgramCache]: Analyzing trace with hash -1486246934, now seen corresponding path program 2 times
[2025-04-28 21:21:17,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:17,493 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379178271]
[2025-04-28 21:21:17,493 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:17,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:17,504 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes.
[2025-04-28 21:21:17,514 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:17,514 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:17,514 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:17,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:17,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:17,744 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379178271]
[2025-04-28 21:21:17,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379178271] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:17,744 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653975020]
[2025-04-28 21:21:17,744 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:17,744 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:17,747 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:17,749 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:17,753 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:17,823 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes.
[2025-04-28 21:21:17,846 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:17,846 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:17,846 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:17,847 INFO  L256         TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:17,848 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:17,931 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:17,931 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:18,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:18,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [653975020] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:18,361 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:18,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8
[2025-04-28 21:21:18,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272102509]
[2025-04-28 21:21:18,361 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:18,362 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:18,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:18,362 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:18,362 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:18,363 INFO  L87              Difference]: Start difference. First operand 15 states and 16 transitions. Second operand  has 8 states, 5 states have (on average 1.8) internal successors, (9), 7 states have internal predecessors, (9), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)
[2025-04-28 21:21:18,458 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:18,458 INFO  L93              Difference]: Finished difference Result 17 states and 18 transitions.
[2025-04-28 21:21:18,458 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:18,459 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 1.8) internal successors, (9), 7 states have internal predecessors, (9), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17
[2025-04-28 21:21:18,459 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:18,459 INFO  L225             Difference]: With dead ends: 17
[2025-04-28 21:21:18,459 INFO  L226             Difference]: Without dead ends: 17
[2025-04-28 21:21:18,460 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:18,461 INFO  L437           NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:18,461 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:18,462 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17 states.
[2025-04-28 21:21:18,464 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17.
[2025-04-28 21:21:18,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17 states, 8 states have (on average 1.125) internal successors, (9), 9 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:18,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions.
[2025-04-28 21:21:18,465 INFO  L79                 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17
[2025-04-28 21:21:18,466 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:18,466 INFO  L485      AbstractCegarLoop]: Abstraction has 17 states and 18 transitions.
[2025-04-28 21:21:18,466 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 1.8) internal successors, (9), 7 states have internal predecessors, (9), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)
[2025-04-28 21:21:18,466 INFO  L278                IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions.
[2025-04-28 21:21:18,466 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:18,467 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:18,467 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:18,472 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:18,671 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:18,671 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:18,672 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:18,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -2056434034, now seen corresponding path program 3 times
[2025-04-28 21:21:18,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:18,672 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413053929]
[2025-04-28 21:21:18,672 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:18,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:18,684 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes.
[2025-04-28 21:21:18,690 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:18,690 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:21:18,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:19,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:19,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:19,061 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413053929]
[2025-04-28 21:21:19,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413053929] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:19,061 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362261056]
[2025-04-28 21:21:19,062 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:19,062 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:19,064 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:19,066 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:19,070 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:19,120 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes.
[2025-04-28 21:21:19,144 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:19,144 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:21:19,144 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:19,146 INFO  L256         TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 22 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:19,148 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:19,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:19,514 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:21,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:21,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362261056] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:21,603 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:21,603 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17
[2025-04-28 21:21:21,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613409839]
[2025-04-28 21:21:21,603 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:21,604 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:21,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:21,605 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:21,605 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:21,605 INFO  L87              Difference]: Start difference. First operand 17 states and 18 transitions. Second operand  has 17 states, 8 states have (on average 2.25) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10)
[2025-04-28 21:21:21,880 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:21,881 INFO  L93              Difference]: Finished difference Result 19 states and 20 transitions.
[2025-04-28 21:21:21,881 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:21,881 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 8 states have (on average 2.25) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Word has length 21
[2025-04-28 21:21:21,882 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:21,882 INFO  L225             Difference]: With dead ends: 19
[2025-04-28 21:21:21,882 INFO  L226             Difference]: Without dead ends: 19
[2025-04-28 21:21:21,883 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:21,883 INFO  L437           NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:21,884 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 70 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:21,884 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2025-04-28 21:21:21,887 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2025-04-28 21:21:21,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:21:21,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions.
[2025-04-28 21:21:21,888 INFO  L79                 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21
[2025-04-28 21:21:21,888 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:21,888 INFO  L485      AbstractCegarLoop]: Abstraction has 19 states and 20 transitions.
[2025-04-28 21:21:21,888 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 8 states have (on average 2.25) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10)
[2025-04-28 21:21:21,888 INFO  L278                IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions.
[2025-04-28 21:21:21,889 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:21,889 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:21,889 INFO  L218           NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:21,895 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:21:22,093 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:22,093 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:22,094 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:22,094 INFO  L85        PathProgramCache]: Analyzing trace with hash -434924750, now seen corresponding path program 4 times
[2025-04-28 21:21:22,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:22,094 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492426942]
[2025-04-28 21:21:22,094 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:22,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:22,102 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:22,110 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:22,110 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:22,110 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:22,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:22,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:22,338 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492426942]
[2025-04-28 21:21:22,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492426942] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:22,338 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072566307]
[2025-04-28 21:21:22,338 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:22,338 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:22,341 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:22,343 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:22,348 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:22,406 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:22,429 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:22,429 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:22,430 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:22,431 INFO  L256         TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:22,433 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:22,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-04-28 21:21:22,526 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:23,481 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-04-28 21:21:23,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072566307] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:23,482 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:23,482 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 12
[2025-04-28 21:21:23,482 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507941377]
[2025-04-28 21:21:23,482 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:23,482 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-04-28 21:21:23,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:23,483 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-04-28 21:21:23,483 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:23,483 INFO  L87              Difference]: Start difference. First operand 19 states and 20 transitions. Second operand  has 12 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 11 states have internal predecessors, (13), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7)
[2025-04-28 21:21:23,568 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:23,568 INFO  L93              Difference]: Finished difference Result 21 states and 22 transitions.
[2025-04-28 21:21:23,569 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:23,570 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 11 states have internal predecessors, (13), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Word has length 25
[2025-04-28 21:21:23,570 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:23,570 INFO  L225             Difference]: With dead ends: 21
[2025-04-28 21:21:23,570 INFO  L226             Difference]: Without dead ends: 21
[2025-04-28 21:21:23,571 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:23,571 INFO  L437           NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:23,572 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 58 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:23,572 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2025-04-28 21:21:23,575 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2025-04-28 21:21:23,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:23,576 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions.
[2025-04-28 21:21:23,578 INFO  L79                 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25
[2025-04-28 21:21:23,578 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:23,578 INFO  L485      AbstractCegarLoop]: Abstraction has 21 states and 22 transitions.
[2025-04-28 21:21:23,578 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 11 states have internal predecessors, (13), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7)
[2025-04-28 21:21:23,579 INFO  L278                IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions.
[2025-04-28 21:21:23,579 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:23,579 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:23,579 INFO  L218           NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:23,586 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:21:23,780 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-04-28 21:21:23,780 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:23,780 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:23,781 INFO  L85        PathProgramCache]: Analyzing trace with hash 1986427350, now seen corresponding path program 5 times
[2025-04-28 21:21:23,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:23,781 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825534893]
[2025-04-28 21:21:23,781 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:23,781 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:23,792 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes.
[2025-04-28 21:21:23,805 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:23,806 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s)
[2025-04-28 21:21:23,806 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:23,806 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:23,811 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:23,818 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:23,818 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:23,819 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:23,851 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:23,851 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:23,853 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:23,855 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-04-28 21:21:23,861 INFO  L422         BasicCegarLoop]: Path program histogram: [5, 1]
[2025-04-28 21:21:23,892 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:23,897 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:23 BoogieIcfgContainer
[2025-04-28 21:21:23,898 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:23,899 INFO  L158              Benchmark]: Toolchain (without parser) took 8718.23ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 164.4MB in the beginning and 95.9MB in the end (delta: 68.5MB). Peak memory consumption was 10.0MB. Max. memory is 33.6GB.
[2025-04-28 21:21:23,899 INFO  L158              Benchmark]: SmtParser took 2.07ms. Allocated memory is still 234.9MB. Free memory is still 171.3MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:23,899 INFO  L158              Benchmark]: ChcToBoogie took 32.62ms. Allocated memory is still 234.9MB. Free memory was 164.4MB in the beginning and 163.9MB in the end (delta: 547.7kB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:23,899 INFO  L158              Benchmark]: Boogie Preprocessor took 60.60ms. Allocated memory is still 234.9MB. Free memory was 163.9MB in the beginning and 161.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:23,901 INFO  L158              Benchmark]: RCFGBuilder took 223.87ms. Allocated memory is still 234.9MB. Free memory was 161.7MB in the beginning and 152.3MB in the end (delta: 9.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:23,902 INFO  L158              Benchmark]: TraceAbstraction took 8391.05ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 151.9MB in the beginning and 95.9MB in the end (delta: 55.9MB). Peak memory consumption was 10.0MB. Max. memory is 33.6GB.
[2025-04-28 21:21:23,903 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 2.07ms. Allocated memory is still 234.9MB. Free memory is still 171.3MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 32.62ms. Allocated memory is still 234.9MB. Free memory was 164.4MB in the beginning and 163.9MB in the end (delta: 547.7kB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 60.60ms. Allocated memory is still 234.9MB. Free memory was 163.9MB in the beginning and 161.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 223.87ms. Allocated memory is still 234.9MB. Free memory was 161.7MB in the beginning and 152.3MB in the end (delta: 9.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * TraceAbstraction took 8391.05ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 151.9MB in the beginning and 95.9MB in the end (delta: 55.9MB). Peak memory consumption was 10.0MB. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Unknown line] : the set of constraint Horn clauses is unsatisfiable
    the set of constraint Horn clauses is unsatisfiable
We found a FailurePath: 
[L0]  CALL  call False();
[L0]        assume !hbv_False_E_1;
      VAL   [hbv_False_E_1=false]
[L0]  CALL  call state(hbv_False_D_2, hbv_False_C_3, hbv_False_A_4, hbv_False_H_5, hbv_False_B_6, hbv_False_F_7, hbv_False_E_1, hbv_False_G_8);
      VAL   [hhv_state_A_2=true, hhv_state_B_4=false, hhv_state_C_1=false, hhv_state_D_0=true, hhv_state_E_6=false, hhv_state_F_5=true, hhv_state_H_3=true]
[L0]        assume ((((((((((((!((((!hbv_state_P_1 || hbv_state_M_2) && (!hbv_state_B_3 || !hbv_state_M_2)) || !hhv_state_D_0) && (((!hbv_state_M_2 && hbv_state_P_1) || hhv_state_D_0) || (hbv_state_M_2 && hbv_state_B_3))) && !((((!hbv_state_M_2 && hbv_state_B_3) || ((!hbv_state_B_3 && !hbv_state_P_1) && hbv_state_M_2)) || hhv_state_C_1) && (((!hbv_state_B_3 || hbv_state_M_2) && ((!hbv_state_M_2 || hbv_state_B_3) || hbv_state_P_1)) || !hhv_state_C_1))) && !((!hhv_state_H_3 || !hhv_state_D_0) && (hhv_state_H_3 || hhv_state_D_0))) && !(!hhv_state_A_2 && !hbv_state_M_2)) && !((hbv_state_L_4 && hbv_state_M_2) && hbv_state_P_1)) && !((!hbv_state_P_1 || !hbv_state_D_6) && (hbv_state_D_6 || hbv_state_P_1))) && !(!hhv_state_E_6 && (!hhv_state_H_3 || !hhv_state_F_5))) && !((!hbv_state_P_1 || !hbv_state_M_2) && !hbv_state_L_4)) && !((hhv_state_H_3 && hhv_state_E_6) && hhv_state_F_5)) && !((!hbv_state_B_3 || !hbv_state_C_7) && (hbv_state_B_3 || hbv_state_C_7))) && !(hbv_state_M_2 && hhv_state_A_2)) && !((!hhv_state_A_2 || !hhv_state_F_5) && (hhv_state_F_5 || hhv_state_A_2))) && !((hhv_state_B_4 || hhv_state_C_1) && (!hhv_state_B_4 || !hhv_state_C_1))) && !((hbv_state_M_2 || hbv_state_A_5) && (!hbv_state_M_2 || !hbv_state_A_5));
      VAL   [hbv_state_A_5=false, hbv_state_B_3=false, hbv_state_C_7=false, hbv_state_D_6=true, hbv_state_L_4=true, hbv_state_M_2=false, hbv_state_P_1=true, hhv_state_A_2=true, hhv_state_B_4=false, hhv_state_C_1=false, hhv_state_D_0=true, hhv_state_E_6=false, hhv_state_F_5=true, hhv_state_H_3=true]
[L0]  CALL  call state(hbv_state_D_6, hbv_state_C_7, hbv_state_A_5, hbv_state_P_1, hbv_state_B_3, hbv_state_M_2, hbv_state_L_4, hbv_state_N_8);
      VAL   [hhv_state_A_2=false, hhv_state_B_4=false, hhv_state_C_1=false, hhv_state_D_0=true, hhv_state_E_6=true, hhv_state_F_5=false, hhv_state_H_3=true]
[L0]        assume ((((((((((((!((((!hbv_state_P_1 || hbv_state_M_2) && (!hbv_state_B_3 || !hbv_state_M_2)) || !hhv_state_D_0) && (((!hbv_state_M_2 && hbv_state_P_1) || hhv_state_D_0) || (hbv_state_M_2 && hbv_state_B_3))) && !((((!hbv_state_M_2 && hbv_state_B_3) || ((!hbv_state_B_3 && !hbv_state_P_1) && hbv_state_M_2)) || hhv_state_C_1) && (((!hbv_state_B_3 || hbv_state_M_2) && ((!hbv_state_M_2 || hbv_state_B_3) || hbv_state_P_1)) || !hhv_state_C_1))) && !((!hhv_state_H_3 || !hhv_state_D_0) && (hhv_state_H_3 || hhv_state_D_0))) && !(!hhv_state_A_2 && !hbv_state_M_2)) && !((hbv_state_L_4 && hbv_state_M_2) && hbv_state_P_1)) && !((!hbv_state_P_1 || !hbv_state_D_6) && (hbv_state_D_6 || hbv_state_P_1))) && !(!hhv_state_E_6 && (!hhv_state_H_3 || !hhv_state_F_5))) && !((!hbv_state_P_1 || !hbv_state_M_2) && !hbv_state_L_4)) && !((hhv_state_H_3 && hhv_state_E_6) && hhv_state_F_5)) && !((!hbv_state_B_3 || !hbv_state_C_7) && (hbv_state_B_3 || hbv_state_C_7))) && !(hbv_state_M_2 && hhv_state_A_2)) && !((!hhv_state_A_2 || !hhv_state_F_5) && (hhv_state_F_5 || hhv_state_A_2))) && !((hhv_state_B_4 || hhv_state_C_1) && (!hhv_state_B_4 || !hhv_state_C_1))) && !((hbv_state_M_2 || hbv_state_A_5) && (!hbv_state_M_2 || !hbv_state_A_5));
      VAL   [hbv_state_A_5=true, hbv_state_B_3=true, hbv_state_C_7=true, hbv_state_D_6=false, hbv_state_L_4=true, hbv_state_M_2=true, hbv_state_P_1=false, hhv_state_A_2=false, hhv_state_B_4=false, hhv_state_C_1=false, hhv_state_D_0=true, hhv_state_E_6=true, hhv_state_F_5=false, hhv_state_H_3=true]
[L0]  CALL  call state(hbv_state_D_6, hbv_state_C_7, hbv_state_A_5, hbv_state_P_1, hbv_state_B_3, hbv_state_M_2, hbv_state_L_4, hbv_state_N_8);
      VAL   [hhv_state_A_2=true, hhv_state_B_4=true, hhv_state_C_1=true, hhv_state_D_0=false, hhv_state_E_6=true, hhv_state_F_5=true, hhv_state_H_3=false]
[L0]        assume ((((((((((((!((((!hbv_state_P_1 || hbv_state_M_2) && (!hbv_state_B_3 || !hbv_state_M_2)) || !hhv_state_D_0) && (((!hbv_state_M_2 && hbv_state_P_1) || hhv_state_D_0) || (hbv_state_M_2 && hbv_state_B_3))) && !((((!hbv_state_M_2 && hbv_state_B_3) || ((!hbv_state_B_3 && !hbv_state_P_1) && hbv_state_M_2)) || hhv_state_C_1) && (((!hbv_state_B_3 || hbv_state_M_2) && ((!hbv_state_M_2 || hbv_state_B_3) || hbv_state_P_1)) || !hhv_state_C_1))) && !((!hhv_state_H_3 || !hhv_state_D_0) && (hhv_state_H_3 || hhv_state_D_0))) && !(!hhv_state_A_2 && !hbv_state_M_2)) && !((hbv_state_L_4 && hbv_state_M_2) && hbv_state_P_1)) && !((!hbv_state_P_1 || !hbv_state_D_6) && (hbv_state_D_6 || hbv_state_P_1))) && !(!hhv_state_E_6 && (!hhv_state_H_3 || !hhv_state_F_5))) && !((!hbv_state_P_1 || !hbv_state_M_2) && !hbv_state_L_4)) && !((hhv_state_H_3 && hhv_state_E_6) && hhv_state_F_5)) && !((!hbv_state_B_3 || !hbv_state_C_7) && (hbv_state_B_3 || hbv_state_C_7))) && !(hbv_state_M_2 && hhv_state_A_2)) && !((!hhv_state_A_2 || !hhv_state_F_5) && (hhv_state_F_5 || hhv_state_A_2))) && !((hhv_state_B_4 || hhv_state_C_1) && (!hhv_state_B_4 || !hhv_state_C_1))) && !((hbv_state_M_2 || hbv_state_A_5) && (!hbv_state_M_2 || !hbv_state_A_5));
      VAL   [hbv_state_A_5=false, hbv_state_B_3=true, hbv_state_C_7=true, hbv_state_D_6=false, hbv_state_L_4=true, hbv_state_M_2=false, hbv_state_P_1=false, hhv_state_A_2=true, hhv_state_B_4=true, hhv_state_C_1=true, hhv_state_D_0=false, hhv_state_E_6=true, hhv_state_F_5=true, hhv_state_H_3=false]
[L0]  CALL  call state(hbv_state_D_6, hbv_state_C_7, hbv_state_A_5, hbv_state_P_1, hbv_state_B_3, hbv_state_M_2, hbv_state_L_4, hbv_state_N_8);
      VAL   [hhv_state_A_2=false, hhv_state_B_4=true, hhv_state_C_1=true, hhv_state_D_0=false, hhv_state_E_6=true, hhv_state_F_5=false, hhv_state_H_3=false]
[L0]        assume ((((((((((((!((((!hbv_state_P_1 || hbv_state_M_2) && (!hbv_state_B_3 || !hbv_state_M_2)) || !hhv_state_D_0) && (((!hbv_state_M_2 && hbv_state_P_1) || hhv_state_D_0) || (hbv_state_M_2 && hbv_state_B_3))) && !((((!hbv_state_M_2 && hbv_state_B_3) || ((!hbv_state_B_3 && !hbv_state_P_1) && hbv_state_M_2)) || hhv_state_C_1) && (((!hbv_state_B_3 || hbv_state_M_2) && ((!hbv_state_M_2 || hbv_state_B_3) || hbv_state_P_1)) || !hhv_state_C_1))) && !((!hhv_state_H_3 || !hhv_state_D_0) && (hhv_state_H_3 || hhv_state_D_0))) && !(!hhv_state_A_2 && !hbv_state_M_2)) && !((hbv_state_L_4 && hbv_state_M_2) && hbv_state_P_1)) && !((!hbv_state_P_1 || !hbv_state_D_6) && (hbv_state_D_6 || hbv_state_P_1))) && !(!hhv_state_E_6 && (!hhv_state_H_3 || !hhv_state_F_5))) && !((!hbv_state_P_1 || !hbv_state_M_2) && !hbv_state_L_4)) && !((hhv_state_H_3 && hhv_state_E_6) && hhv_state_F_5)) && !((!hbv_state_B_3 || !hbv_state_C_7) && (hbv_state_B_3 || hbv_state_C_7))) && !(hbv_state_M_2 && hhv_state_A_2)) && !((!hhv_state_A_2 || !hhv_state_F_5) && (hhv_state_F_5 || hhv_state_A_2))) && !((hhv_state_B_4 || hhv_state_C_1) && (!hhv_state_B_4 || !hhv_state_C_1))) && !((hbv_state_M_2 || hbv_state_A_5) && (!hbv_state_M_2 || !hbv_state_A_5));
      VAL   [hbv_state_A_5=true, hbv_state_B_3=false, hbv_state_C_7=false, hbv_state_D_6=false, hbv_state_L_4=true, hbv_state_M_2=true, hbv_state_P_1=false, hhv_state_A_2=false, hhv_state_B_4=true, hhv_state_C_1=true, hhv_state_D_0=false, hhv_state_E_6=true, hhv_state_F_5=false, hhv_state_H_3=false]
[L0]  CALL  call state(hbv_state_D_6, hbv_state_C_7, hbv_state_A_5, hbv_state_P_1, hbv_state_B_3, hbv_state_M_2, hbv_state_L_4, hbv_state_N_8);
      VAL   [hhv_state_A_2=true, hhv_state_B_4=false, hhv_state_C_1=false, hhv_state_D_0=false, hhv_state_E_6=true, hhv_state_F_5=true, hhv_state_H_3=false]
[L0]        assume ((((((((((((!((((!hbv_state_P_1 || hbv_state_M_2) && (!hbv_state_B_3 || !hbv_state_M_2)) || !hhv_state_D_0) && (((!hbv_state_M_2 && hbv_state_P_1) || hhv_state_D_0) || (hbv_state_M_2 && hbv_state_B_3))) && !((((!hbv_state_M_2 && hbv_state_B_3) || ((!hbv_state_B_3 && !hbv_state_P_1) && hbv_state_M_2)) || hhv_state_C_1) && (((!hbv_state_B_3 || hbv_state_M_2) && ((!hbv_state_M_2 || hbv_state_B_3) || hbv_state_P_1)) || !hhv_state_C_1))) && !((!hhv_state_H_3 || !hhv_state_D_0) && (hhv_state_H_3 || hhv_state_D_0))) && !(!hhv_state_A_2 && !hbv_state_M_2)) && !((hbv_state_L_4 && hbv_state_M_2) && hbv_state_P_1)) && !((!hbv_state_P_1 || !hbv_state_D_6) && (hbv_state_D_6 || hbv_state_P_1))) && !(!hhv_state_E_6 && (!hhv_state_H_3 || !hhv_state_F_5))) && !((!hbv_state_P_1 || !hbv_state_M_2) && !hbv_state_L_4)) && !((hhv_state_H_3 && hhv_state_E_6) && hhv_state_F_5)) && !((!hbv_state_B_3 || !hbv_state_C_7) && (hbv_state_B_3 || hbv_state_C_7))) && !(hbv_state_M_2 && hhv_state_A_2)) && !((!hhv_state_A_2 || !hhv_state_F_5) && (hhv_state_F_5 || hhv_state_A_2))) && !((hhv_state_B_4 || hhv_state_C_1) && (!hhv_state_B_4 || !hhv_state_C_1))) && !((hbv_state_M_2 || hbv_state_A_5) && (!hbv_state_M_2 || !hbv_state_A_5));
      VAL   [hbv_state_A_5=false, hbv_state_B_3=false, hbv_state_C_7=false, hbv_state_D_6=false, hbv_state_L_4=true, hbv_state_M_2=false, hbv_state_P_1=false, hhv_state_A_2=true, hhv_state_B_4=false, hhv_state_C_1=false, hhv_state_D_0=false, hhv_state_E_6=true, hhv_state_F_5=true, hhv_state_H_3=false]
[L0]  CALL  call state(hbv_state_D_6, hbv_state_C_7, hbv_state_A_5, hbv_state_P_1, hbv_state_B_3, hbv_state_M_2, hbv_state_L_4, hbv_state_N_8);
      VAL   [hhv_state_A_2=false, hhv_state_B_4=false, hhv_state_C_1=false, hhv_state_D_0=false, hhv_state_E_6=true, hhv_state_F_5=false, hhv_state_H_3=false]
[L0]        assume ((((((!((!hhv_state_B_4 || !hhv_state_C_1) && (hhv_state_B_4 || hhv_state_C_1)) && !((hhv_state_H_3 && hhv_state_F_5) && hhv_state_E_6)) && !hhv_state_A_2) && !((!hhv_state_H_3 || !hhv_state_D_0) && (hhv_state_H_3 || hhv_state_D_0))) && !hhv_state_C_1) && !((!hhv_state_F_5 || !hhv_state_A_2) && (hhv_state_A_2 || hhv_state_F_5))) && !((!hhv_state_F_5 || !hhv_state_H_3) && !hhv_state_E_6)) && !hhv_state_D_0;
      VAL   [hhv_state_A_2=false, hhv_state_B_4=false, hhv_state_C_1=false, hhv_state_D_0=false, hhv_state_E_6=true, hhv_state_F_5=false, hhv_state_H_3=false]
[L0]  RET   call state(hbv_state_D_6, hbv_state_C_7, hbv_state_A_5, hbv_state_P_1, hbv_state_B_3, hbv_state_M_2, hbv_state_L_4, hbv_state_N_8);
      VAL   [hbv_state_A_5=false, hbv_state_B_3=false, hbv_state_C_7=false, hbv_state_D_6=false, hbv_state_L_4=true, hbv_state_M_2=false, hbv_state_N_8=false, hbv_state_P_1=false, hhv_state_A_2=true, hhv_state_B_4=false, hhv_state_C_1=false, hhv_state_D_0=false, hhv_state_E_6=true, hhv_state_F_5=true, hhv_state_H_3=false]
[L0]  RET   call state(hbv_state_D_6, hbv_state_C_7, hbv_state_A_5, hbv_state_P_1, hbv_state_B_3, hbv_state_M_2, hbv_state_L_4, hbv_state_N_8);
      VAL   [hbv_state_A_5=true, hbv_state_B_3=false, hbv_state_C_7=false, hbv_state_D_6=false, hbv_state_L_4=true, hbv_state_M_2=true, hbv_state_N_8=false, hbv_state_P_1=false, hhv_state_A_2=false, hhv_state_B_4=true, hhv_state_C_1=true, hhv_state_D_0=false, hhv_state_E_6=true, hhv_state_F_5=false, hhv_state_H_3=false]
[L0]  RET   call state(hbv_state_D_6, hbv_state_C_7, hbv_state_A_5, hbv_state_P_1, hbv_state_B_3, hbv_state_M_2, hbv_state_L_4, hbv_state_N_8);
      VAL   [hbv_state_A_5=false, hbv_state_B_3=true, hbv_state_C_7=true, hbv_state_D_6=false, hbv_state_L_4=true, hbv_state_M_2=false, hbv_state_N_8=false, hbv_state_P_1=false, hhv_state_A_2=true, hhv_state_B_4=true, hhv_state_C_1=true, hhv_state_D_0=false, hhv_state_E_6=true, hhv_state_F_5=true, hhv_state_H_3=false]
[L0]  RET   call state(hbv_state_D_6, hbv_state_C_7, hbv_state_A_5, hbv_state_P_1, hbv_state_B_3, hbv_state_M_2, hbv_state_L_4, hbv_state_N_8);
      VAL   [hbv_state_A_5=true, hbv_state_B_3=true, hbv_state_C_7=true, hbv_state_D_6=false, hbv_state_L_4=true, hbv_state_M_2=true, hbv_state_N_8=false, hbv_state_P_1=false, hhv_state_A_2=false, hhv_state_B_4=false, hhv_state_C_1=false, hhv_state_D_0=true, hhv_state_E_6=true, hhv_state_F_5=false, hhv_state_H_3=true]
[L0]  RET   call state(hbv_state_D_6, hbv_state_C_7, hbv_state_A_5, hbv_state_P_1, hbv_state_B_3, hbv_state_M_2, hbv_state_L_4, hbv_state_N_8);
      VAL   [hbv_state_A_5=false, hbv_state_B_3=false, hbv_state_C_7=false, hbv_state_D_6=true, hbv_state_L_4=true, hbv_state_M_2=false, hbv_state_N_8=false, hbv_state_P_1=true, hhv_state_A_2=true, hhv_state_B_4=false, hhv_state_C_1=false, hhv_state_D_0=true, hhv_state_E_6=false, hhv_state_F_5=true, hhv_state_H_3=true]
[L0]  RET   call state(hbv_False_D_2, hbv_False_C_3, hbv_False_A_4, hbv_False_H_5, hbv_False_B_6, hbv_False_F_7, hbv_False_E_1, hbv_False_G_8);
      VAL   [hbv_False_A_4=true, hbv_False_B_6=false, hbv_False_C_3=false, hbv_False_D_2=true, hbv_False_E_1=false, hbv_False_F_7=true, hbv_False_G_8=false, hbv_False_H_5=true]
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 13 locations, 17 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 234 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 144 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 57 mSDtfsCounter, 144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 441 SizeOfPredicates, 44 NumberOfNonLiveVariables, 376 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 72/210 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2025-04-28 21:21:23,925 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
unsat
