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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:48,651 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:48,722 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c8085-6d78-430c-9c74-68b588e60bf3/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:48,727 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:48,728 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:48,761 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:48,762 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:48,762 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:48,762 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:48,763 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:48,763 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:48,763 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:48,763 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:48,763 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:48,763 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:48,764 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:48,764 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:48,764 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:48,764 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:48,764 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:48,764 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:48,764 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:48,764 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:48,764 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:48,764 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:48,765 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:48,765 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:49,099 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:49,110 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:49,113 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:49,114 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:49,116 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:49,118 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c8085-6d78-430c-9c74-68b588e60bf3/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-022.smt2
[2025-04-28 21:21:49,119 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:49,124 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:49,314 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c8085-6d78-430c-9c74-68b588e60bf3/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-022.smt2
[2025-04-28 21:21:49,320 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:49,322 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:49,325 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:49,325 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:49,325 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:49,329 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,363 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49 Unit
[2025-04-28 21:21:49,364 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:49,366 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:49,367 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:49,367 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:49,384 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,385 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,411 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,412 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,414 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,415 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,420 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,421 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,421 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,434 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:49,435 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:49,435 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:49,435 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:49,436 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,439 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:49,455 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:49,469 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:49,475 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:49,488 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:49,488 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:49,489 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:49,489 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATverifier.error.split given in one single declaration
[2025-04-28 21:21:49,489 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATverifier.error.split
[2025-04-28 21:21:49,489 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATverifier.error.split
[2025-04-28 21:21:49,489 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb given in one single declaration
[2025-04-28 21:21:49,490 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb
[2025-04-28 21:21:49,490 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb
[2025-04-28 21:21:49,490 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-04-28 21:21:49,490 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-04-28 21:21:49,490 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-04-28 21:21:49,490 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:49,490 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:49,490 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:49,542 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:49,544 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:49,690 INFO  L?                        ?]: Removed 31 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:49,690 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:49,702 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:49,705 INFO  L312             CfgBuilder]: Removed 2 assume(true) statements.
[2025-04-28 21:21:49,705 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:49 BoogieIcfgContainer
[2025-04-28 21:21:49,706 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:49,711 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:49,711 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:49,715 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:49,715 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:49" (1/3) ...
[2025-04-28 21:21:49,716 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c20e989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:49, skipping insertion in model container
[2025-04-28 21:21:49,717 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (2/3) ...
[2025-04-28 21:21:49,717 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c20e989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:49, skipping insertion in model container
[2025-04-28 21:21:49,717 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:49" (3/3) ...
[2025-04-28 21:21:49,719 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:49,733 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:49,734 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 5 procedures, 19 locations, 25 edges, 5 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:49,772 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:49,785 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;@2078dfd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:49,785 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:49,789 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 19 states, 8 states have (on average 1.25) internal successors, (10), 10 states have internal predecessors, (10), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2025-04-28 21:21:49,797 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-04-28 21:21:49,797 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:49,798 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:49,798 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:49,804 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:49,804 INFO  L85        PathProgramCache]: Analyzing trace with hash -1050092745, now seen corresponding path program 1 times
[2025-04-28 21:21:49,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:49,813 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888348876]
[2025-04-28 21:21:49,814 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:49,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:49,845 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-04-28 21:21:49,876 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-04-28 21:21:49,877 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:49,877 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:50,348 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:50,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:50,349 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888348876]
[2025-04-28 21:21:50,351 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888348876] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:50,351 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:50,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:50,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500352034]
[2025-04-28 21:21:50,358 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:50,363 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:50,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:50,398 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:50,398 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:50,400 INFO  L87              Difference]: Start difference. First operand  has 19 states, 8 states have (on average 1.25) internal successors, (10), 10 states have internal predecessors, (10), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:50,441 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:50,441 INFO  L93              Difference]: Finished difference Result 19 states and 20 transitions.
[2025-04-28 21:21:50,443 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:50,444 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 15
[2025-04-28 21:21:50,445 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:50,450 INFO  L225             Difference]: With dead ends: 19
[2025-04-28 21:21:50,450 INFO  L226             Difference]: Without dead ends: 19
[2025-04-28 21:21:50,452 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:50,455 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 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:50,456 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 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:50,492 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2025-04-28 21:21:50,522 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2025-04-28 21:21:50,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19 states, 8 states have (on average 1.125) internal successors, (9), 9 states have internal predecessors, (9), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6)
[2025-04-28 21:21:50,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions.
[2025-04-28 21:21:50,528 INFO  L79                 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15
[2025-04-28 21:21:50,528 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:50,528 INFO  L485      AbstractCegarLoop]: Abstraction has 19 states and 20 transitions.
[2025-04-28 21:21:50,529 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:50,529 INFO  L278                IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions.
[2025-04-28 21:21:50,530 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-28 21:21:50,530 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,530 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,531 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:50,531 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,532 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,532 INFO  L85        PathProgramCache]: Analyzing trace with hash -721044357, now seen corresponding path program 1 times
[2025-04-28 21:21:50,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,532 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532969316]
[2025-04-28 21:21:50,532 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:50,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,578 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:50,607 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:50,607 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,607 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,278 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:51,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,279 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532969316]
[2025-04-28 21:21:51,279 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532969316] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:51,279 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658697552]
[2025-04-28 21:21:51,279 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,279 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:51,282 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:51,286 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:51,290 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:51,353 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:51,384 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:51,384 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,384 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,388 WARN  L254         TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 42 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:51,400 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:51,850 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:51,850 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:53,960 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:53,960 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658697552] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:53,960 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:53,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2025-04-28 21:21:53,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953430442]
[2025-04-28 21:21:53,962 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:53,964 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:53,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:53,966 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:53,967 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:53,967 INFO  L87              Difference]: Start difference. First operand 19 states and 20 transitions. Second operand  has 13 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 13 states have internal predecessors, (17), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 9 states have call successors, (10)
[2025-04-28 21:21:54,121 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:54,122 INFO  L93              Difference]: Finished difference Result 23 states and 24 transitions.
[2025-04-28 21:21:54,123 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:54,123 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 13 states have internal predecessors, (17), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 9 states have call successors, (10) Word has length 19
[2025-04-28 21:21:54,123 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:54,124 INFO  L225             Difference]: With dead ends: 23
[2025-04-28 21:21:54,124 INFO  L226             Difference]: Without dead ends: 23
[2025-04-28 21:21:54,124 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:54,125 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:54,126 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 116 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:54,126 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2025-04-28 21:21:54,129 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2025-04-28 21:21:54,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8)
[2025-04-28 21:21:54,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions.
[2025-04-28 21:21:54,130 INFO  L79                 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19
[2025-04-28 21:21:54,131 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:54,131 INFO  L485      AbstractCegarLoop]: Abstraction has 23 states and 24 transitions.
[2025-04-28 21:21:54,131 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 13 states have internal predecessors, (17), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 9 states have call successors, (10)
[2025-04-28 21:21:54,131 INFO  L278                IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions.
[2025-04-28 21:21:54,132 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-04-28 21:21:54,132 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:54,132 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:54,138 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:54,336 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:54,336 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:54,336 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:54,337 INFO  L85        PathProgramCache]: Analyzing trace with hash -1172968829, now seen corresponding path program 2 times
[2025-04-28 21:21:54,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:54,337 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051877137]
[2025-04-28 21:21:54,337 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:54,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:54,351 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes.
[2025-04-28 21:21:54,374 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:54,374 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:54,374 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,283 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:55,283 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:55,283 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051877137]
[2025-04-28 21:21:55,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051877137] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:55,284 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426246463]
[2025-04-28 21:21:55,284 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:55,284 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:55,287 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:55,289 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:55,292 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:55,347 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes.
[2025-04-28 21:21:55,377 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:55,377 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:55,377 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,380 WARN  L254         TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 70 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:55,383 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:55,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:55,828 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:00,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:22:00,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [426246463] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:00,512 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:00,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21
[2025-04-28 21:22:00,513 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386769004]
[2025-04-28 21:22:00,513 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:00,513 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-04-28 21:22:00,513 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:00,514 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-04-28 21:22:00,515 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420
[2025-04-28 21:22:00,515 INFO  L87              Difference]: Start difference. First operand 23 states and 24 transitions. Second operand  has 21 states, 10 states have (on average 2.4) internal successors, (24), 21 states have internal predecessors, (24), 13 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (15), 9 states have call predecessors, (15), 13 states have call successors, (15)
[2025-04-28 21:22:00,684 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:00,684 INFO  L93              Difference]: Finished difference Result 25 states and 26 transitions.
[2025-04-28 21:22:00,685 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:22:00,685 INFO  L79                 Accepts]: Start accepts. Automaton has  has 21 states, 10 states have (on average 2.4) internal successors, (24), 21 states have internal predecessors, (24), 13 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (15), 9 states have call predecessors, (15), 13 states have call successors, (15) Word has length 27
[2025-04-28 21:22:00,686 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:00,686 INFO  L225             Difference]: With dead ends: 25
[2025-04-28 21:22:00,686 INFO  L226             Difference]: Without dead ends: 25
[2025-04-28 21:22:00,687 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:22:00,688 INFO  L437           NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:00,688 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 149 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:22:00,689 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2025-04-28 21:22:00,692 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2025-04-28 21:22:00,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9)
[2025-04-28 21:22:00,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions.
[2025-04-28 21:22:00,693 INFO  L79                 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 27
[2025-04-28 21:22:00,693 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:00,693 INFO  L485      AbstractCegarLoop]: Abstraction has 25 states and 26 transitions.
[2025-04-28 21:22:00,693 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 10 states have (on average 2.4) internal successors, (24), 21 states have internal predecessors, (24), 13 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (15), 9 states have call predecessors, (15), 13 states have call successors, (15)
[2025-04-28 21:22:00,694 INFO  L278                IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions.
[2025-04-28 21:22:00,694 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-04-28 21:22:00,694 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:00,695 INFO  L218           NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:00,700 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:22:00,895 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:22:00,895 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:00,896 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:00,896 INFO  L85        PathProgramCache]: Analyzing trace with hash -529107129, now seen corresponding path program 3 times
[2025-04-28 21:22:00,896 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:00,896 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959531404]
[2025-04-28 21:22:00,896 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:22:00,896 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:00,904 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 5 equivalence classes.
[2025-04-28 21:22:00,944 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 31 of 31 statements.
[2025-04-28 21:22:00,945 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-04-28 21:22:00,945 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:22:00,945 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:22:00,953 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-04-28 21:22:00,971 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-04-28 21:22:00,971 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:00,971 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:22:00,992 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:22:00,992 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:22:00,993 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:22:00,996 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:22:00,999 INFO  L422         BasicCegarLoop]: Path program histogram: [3, 1]
[2025-04-28 21:22:01,017 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:22:01,023 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:22:01 BoogieIcfgContainer
[2025-04-28 21:22:01,026 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:22:01,027 INFO  L158              Benchmark]: Toolchain (without parser) took 11705.52ms. Allocated memory was 234.9MB in the beginning and 335.5MB in the end (delta: 100.7MB). Free memory was 161.5MB in the beginning and 269.5MB in the end (delta: -108.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:22:01,027 INFO  L158              Benchmark]: SmtParser took 0.35ms. Allocated memory is still 234.9MB. Free memory is still 169.3MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:22:01,028 INFO  L158              Benchmark]: ChcToBoogie took 40.79ms. Allocated memory is still 234.9MB. Free memory was 161.5MB in the beginning and 160.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:22:01,028 INFO  L158              Benchmark]: Boogie Preprocessor took 68.44ms. Allocated memory is still 234.9MB. Free memory was 160.2MB in the beginning and 157.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:22:01,028 INFO  L158              Benchmark]: RCFGBuilder took 271.29ms. Allocated memory is still 234.9MB. Free memory was 157.8MB in the beginning and 148.4MB in the end (delta: 9.4MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:22:01,029 INFO  L158              Benchmark]: TraceAbstraction took 11315.34ms. Allocated memory was 234.9MB in the beginning and 335.5MB in the end (delta: 100.7MB). Free memory was 148.0MB in the beginning and 269.5MB in the end (delta: -121.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:22:01,033 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.35ms. Allocated memory is still 234.9MB. Free memory is still 169.3MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 40.79ms. Allocated memory is still 234.9MB. Free memory was 161.5MB in the beginning and 160.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 68.44ms. Allocated memory is still 234.9MB. Free memory was 160.2MB in the beginning and 157.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 271.29ms. Allocated memory is still 234.9MB. Free memory was 157.8MB in the beginning and 148.4MB in the end (delta: 9.4MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 11315.34ms. Allocated memory was 234.9MB in the beginning and 335.5MB in the end (delta: 100.7MB). Free memory was 148.0MB in the beginning and 269.5MB in the end (delta: -121.5MB). There was no memory consumed. 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]  CALL  call main.ATverifier.error.split();
[L0]        assume ((((((((((((((((!!hbv_main.ATverifier.error.split_R_15 && !(hbv_main.ATverifier.error.split_L_6 && (!hbv_main.ATverifier.error.split_L_6 || !hbv_main.ATverifier.error.split_K_7))) && !((!hbv_main.ATverifier.error.split_R_15 || !hbv_main.ATverifier.error.split_Q_5) && hbv_main.ATverifier.error.split_R_15)) && !(((hbv_main.ATverifier.error.split_F_9 == hbv_main.ATverifier.error.split_E_10 || hbv_main.ATverifier.error.split_G_14) && (!hbv_main.ATverifier.error.split_G_14 || hbv_main.ATverifier.error.split_F_9 != hbv_main.ATverifier.error.split_E_10)) && hbv_main.ATverifier.error.split_K_7)) && !(((hbv_main.ATverifier.error.split_M_12 != 0 || !hbv_main.ATverifier.error.split_N_17) && hbv_main.ATverifier.error.split_O_16) && (hbv_main.ATverifier.error.split_M_12 == 0 || hbv_main.ATverifier.error.split_N_17))) && !(hbv_main.ATverifier.error.split_M_12 != (if hbv_main.ATverifier.error.split_I_13 then 1 else 0) && hbv_main.ATverifier.error.split_K_7)) && !((!hbv_main.ATverifier.error.split_B_11 || !hbv_main.ATverifier.error.split_K_7) && hbv_main.ATverifier.error.split_K_7)) && !(hbv_main.ATverifier.error.split_O_16 && !hbv_main.ATverifier.error.split_N_17)) && !(2 * hbv_main.ATverifier.error.split_D_2 != hbv_main.ATverifier.error.split_E_10 && hbv_main.ATverifier.error.split_K_7)) && !((((!hbv_main.ATverifier.error.split_H_8 && !hbv_main.ATverifier.error.split_G_14) || !hbv_main.ATverifier.error.split_I_13) && hbv_main.ATverifier.error.split_K_7) && ((hbv_main.ATverifier.error.split_H_8 || hbv_main.ATverifier.error.split_I_13) || hbv_main.ATverifier.error.split_G_14))) && !(((hbv_main.ATverifier.error.split_H_8 || hbv_main.ATverifier.error.split_F_9 == 0) && hbv_main.ATverifier.error.split_K_7) && (!hbv_main.ATverifier.error.split_H_8 || hbv_main.ATverifier.error.split_F_9 != 0))) && !((!hbv_main.ATverifier.error.split_P_4 || !hbv_main.ATverifier.error.split_O_16) && hbv_main.ATverifier.error.split_P_4)) && !((!hbv_main.ATverifier.error.split_P_4 || !hbv_main.ATverifier.error.split_Q_5) && hbv_main.ATverifier.error.split_Q_5)) && !((hbv_main.ATverifier.error.split_K_7 && hbv_main.ATverifier.error.split_B_11) && !hbv_main.ATverifier.error.split_C_3)) && !(hbv_main.ATverifier.error.split_J_18 && hbv_main.ATverifier.error.split_K_7)) && !(hbv_main.ATverifier.error.split_A_1 <= hbv_main.ATverifier.error.split_D_2 && hbv_main.ATverifier.error.split_C_3)) && !(hbv_main.ATverifier.error.split_D_2 < hbv_main.ATverifier.error.split_A_1 && !hbv_main.ATverifier.error.split_C_3)) && !((!hbv_main.ATverifier.error.split_O_16 || !hbv_main.ATverifier.error.split_L_6) && hbv_main.ATverifier.error.split_O_16);
      VAL   [hbv_main.ATverifier.error.split_A_1=5, hbv_main.ATverifier.error.split_D_2=4, hbv_main.ATverifier.error.split_F_9=-10]
[L0]  CALL  call main.AT_bb(hbv_main.ATverifier.error.split_D_2, hbv_main.ATverifier.error.split_F_9, hbv_main.ATverifier.error.split_A_1);
      VAL   [hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=-10, hhv_main.AT_bb_I_2=5]
[L0]        assume ((((((((((((!(hbv_main.AT_bb_K_4 && 2 + hbv_main.AT_bb_C_10 != hbv_main.AT_bb_E_11) && !((hbv_main.AT_bb_K_4 && hbv_main.AT_bb_B_6) && hbv_main.AT_bb_A_9)) && !(hbv_main.AT_bb_B_6 && hbv_main.AT_bb_A_5 <= hhv_main.AT_bb_G_0)) && !((hbv_main.AT_bb_F_1 != hbv_main.AT_bb_H_2 && hbv_main.AT_bb_E_3) && hbv_main.AT_bb_K_4)) && !(hbv_main.AT_bb_K_4 && (if hbv_main.AT_bb_D_8 then -10 else hbv_main.AT_bb_E_11) != hbv_main.AT_bb_H_2)) && !!hbv_main.AT_bb_E_3) && !((hbv_main.AT_bb_E_3 && hbv_main.AT_bb_K_4) && hhv_main.AT_bb_H_1 != hbv_main.AT_bb_F_1)) && !(!hbv_main.AT_bb_B_6 && hhv_main.AT_bb_G_0 < hbv_main.AT_bb_A_5)) && !(hbv_main.AT_bb_K_4 && hbv_main.AT_bb_A_5 + 1 != hbv_main.AT_bb_G_12)) && !((!hbv_main.AT_bb_E_3 || !hbv_main.AT_bb_K_4) && hbv_main.AT_bb_E_3)) && !((hbv_main.AT_bb_E_3 && hbv_main.AT_bb_K_4) && hhv_main.AT_bb_I_2 != hbv_main.AT_bb_I_7)) && !(((hbv_main.AT_bb_D_8 || hbv_main.AT_bb_A_5 == 4) && hbv_main.AT_bb_K_4) && (hbv_main.AT_bb_A_5 != 4 || !hbv_main.AT_bb_D_8))) && !((hbv_main.AT_bb_I_7 != hbv_main.AT_bb_G_12 && hbv_main.AT_bb_E_3) && hbv_main.AT_bb_K_4)) && !(hbv_main.AT_bb_K_4 && (!hbv_main.AT_bb_K_4 || !hbv_main.AT_bb_A_9));
      VAL   [hbv_main.AT_bb_A_5=4, hbv_main.AT_bb_C_10=6, hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=-10, hhv_main.AT_bb_I_2=5]
[L0]  CALL  call main.AT_bb(hhv_main.AT_bb_G_0, hbv_main.AT_bb_C_10, hbv_main.AT_bb_A_5);
      VAL   [hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=6, hhv_main.AT_bb_I_2=4]
[L0]        assume ((((((((((((!(hbv_main.AT_bb_K_4 && 2 + hbv_main.AT_bb_C_10 != hbv_main.AT_bb_E_11) && !((hbv_main.AT_bb_K_4 && hbv_main.AT_bb_B_6) && hbv_main.AT_bb_A_9)) && !(hbv_main.AT_bb_B_6 && hbv_main.AT_bb_A_5 <= hhv_main.AT_bb_G_0)) && !((hbv_main.AT_bb_F_1 != hbv_main.AT_bb_H_2 && hbv_main.AT_bb_E_3) && hbv_main.AT_bb_K_4)) && !(hbv_main.AT_bb_K_4 && (if hbv_main.AT_bb_D_8 then -10 else hbv_main.AT_bb_E_11) != hbv_main.AT_bb_H_2)) && !!hbv_main.AT_bb_E_3) && !((hbv_main.AT_bb_E_3 && hbv_main.AT_bb_K_4) && hhv_main.AT_bb_H_1 != hbv_main.AT_bb_F_1)) && !(!hbv_main.AT_bb_B_6 && hhv_main.AT_bb_G_0 < hbv_main.AT_bb_A_5)) && !(hbv_main.AT_bb_K_4 && hbv_main.AT_bb_A_5 + 1 != hbv_main.AT_bb_G_12)) && !((!hbv_main.AT_bb_E_3 || !hbv_main.AT_bb_K_4) && hbv_main.AT_bb_E_3)) && !((hbv_main.AT_bb_E_3 && hbv_main.AT_bb_K_4) && hhv_main.AT_bb_I_2 != hbv_main.AT_bb_I_7)) && !(((hbv_main.AT_bb_D_8 || hbv_main.AT_bb_A_5 == 4) && hbv_main.AT_bb_K_4) && (hbv_main.AT_bb_A_5 != 4 || !hbv_main.AT_bb_D_8))) && !((hbv_main.AT_bb_I_7 != hbv_main.AT_bb_G_12 && hbv_main.AT_bb_E_3) && hbv_main.AT_bb_K_4)) && !(hbv_main.AT_bb_K_4 && (!hbv_main.AT_bb_K_4 || !hbv_main.AT_bb_A_9));
      VAL   [hbv_main.AT_bb_A_5=3, hbv_main.AT_bb_C_10=4, hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=6, hhv_main.AT_bb_I_2=4]
[L0]  CALL  call main.AT_bb(hhv_main.AT_bb_G_0, hbv_main.AT_bb_C_10, hbv_main.AT_bb_A_5);
      VAL   [hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=4, hhv_main.AT_bb_I_2=3]
[L0]        assume ((((((((((((!(hbv_main.AT_bb_K_4 && 2 + hbv_main.AT_bb_C_10 != hbv_main.AT_bb_E_11) && !((hbv_main.AT_bb_K_4 && hbv_main.AT_bb_B_6) && hbv_main.AT_bb_A_9)) && !(hbv_main.AT_bb_B_6 && hbv_main.AT_bb_A_5 <= hhv_main.AT_bb_G_0)) && !((hbv_main.AT_bb_F_1 != hbv_main.AT_bb_H_2 && hbv_main.AT_bb_E_3) && hbv_main.AT_bb_K_4)) && !(hbv_main.AT_bb_K_4 && (if hbv_main.AT_bb_D_8 then -10 else hbv_main.AT_bb_E_11) != hbv_main.AT_bb_H_2)) && !!hbv_main.AT_bb_E_3) && !((hbv_main.AT_bb_E_3 && hbv_main.AT_bb_K_4) && hhv_main.AT_bb_H_1 != hbv_main.AT_bb_F_1)) && !(!hbv_main.AT_bb_B_6 && hhv_main.AT_bb_G_0 < hbv_main.AT_bb_A_5)) && !(hbv_main.AT_bb_K_4 && hbv_main.AT_bb_A_5 + 1 != hbv_main.AT_bb_G_12)) && !((!hbv_main.AT_bb_E_3 || !hbv_main.AT_bb_K_4) && hbv_main.AT_bb_E_3)) && !((hbv_main.AT_bb_E_3 && hbv_main.AT_bb_K_4) && hhv_main.AT_bb_I_2 != hbv_main.AT_bb_I_7)) && !(((hbv_main.AT_bb_D_8 || hbv_main.AT_bb_A_5 == 4) && hbv_main.AT_bb_K_4) && (hbv_main.AT_bb_A_5 != 4 || !hbv_main.AT_bb_D_8))) && !((hbv_main.AT_bb_I_7 != hbv_main.AT_bb_G_12 && hbv_main.AT_bb_E_3) && hbv_main.AT_bb_K_4)) && !(hbv_main.AT_bb_K_4 && (!hbv_main.AT_bb_K_4 || !hbv_main.AT_bb_A_9));
      VAL   [hbv_main.AT_bb_A_5=2, hbv_main.AT_bb_C_10=2, hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=4, hhv_main.AT_bb_I_2=3]
[L0]  CALL  call main.AT_bb(hhv_main.AT_bb_G_0, hbv_main.AT_bb_C_10, hbv_main.AT_bb_A_5);
      VAL   [hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=2, hhv_main.AT_bb_I_2=2]
[L0]        assume ((((((((((((!(hbv_main.AT_bb_K_4 && 2 + hbv_main.AT_bb_C_10 != hbv_main.AT_bb_E_11) && !((hbv_main.AT_bb_K_4 && hbv_main.AT_bb_B_6) && hbv_main.AT_bb_A_9)) && !(hbv_main.AT_bb_B_6 && hbv_main.AT_bb_A_5 <= hhv_main.AT_bb_G_0)) && !((hbv_main.AT_bb_F_1 != hbv_main.AT_bb_H_2 && hbv_main.AT_bb_E_3) && hbv_main.AT_bb_K_4)) && !(hbv_main.AT_bb_K_4 && (if hbv_main.AT_bb_D_8 then -10 else hbv_main.AT_bb_E_11) != hbv_main.AT_bb_H_2)) && !!hbv_main.AT_bb_E_3) && !((hbv_main.AT_bb_E_3 && hbv_main.AT_bb_K_4) && hhv_main.AT_bb_H_1 != hbv_main.AT_bb_F_1)) && !(!hbv_main.AT_bb_B_6 && hhv_main.AT_bb_G_0 < hbv_main.AT_bb_A_5)) && !(hbv_main.AT_bb_K_4 && hbv_main.AT_bb_A_5 + 1 != hbv_main.AT_bb_G_12)) && !((!hbv_main.AT_bb_E_3 || !hbv_main.AT_bb_K_4) && hbv_main.AT_bb_E_3)) && !((hbv_main.AT_bb_E_3 && hbv_main.AT_bb_K_4) && hhv_main.AT_bb_I_2 != hbv_main.AT_bb_I_7)) && !(((hbv_main.AT_bb_D_8 || hbv_main.AT_bb_A_5 == 4) && hbv_main.AT_bb_K_4) && (hbv_main.AT_bb_A_5 != 4 || !hbv_main.AT_bb_D_8))) && !((hbv_main.AT_bb_I_7 != hbv_main.AT_bb_G_12 && hbv_main.AT_bb_E_3) && hbv_main.AT_bb_K_4)) && !(hbv_main.AT_bb_K_4 && (!hbv_main.AT_bb_K_4 || !hbv_main.AT_bb_A_9));
      VAL   [hbv_main.AT_bb_A_5=1, hbv_main.AT_bb_C_10=0, hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=2, hhv_main.AT_bb_I_2=2]
[L0]  CALL  call main.AT_bb(hhv_main.AT_bb_G_0, hbv_main.AT_bb_C_10, hbv_main.AT_bb_A_5);
      VAL   [hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=0, hhv_main.AT_bb_I_2=1]
[L0]        assume (((((!((hbv_main.AT_bb_D_2 && hbv_main.AT_bb_E_3) && hhv_main.AT_bb_H_1 != hbv_main.AT_bb_F_1) && !((hbv_main.AT_bb_D_2 && hbv_main.AT_bb_E_3) && hhv_main.AT_bb_I_2 != hbv_main.AT_bb_C_6)) && !((hbv_main.AT_bb_D_2 && hbv_main.AT_bb_E_3) && hbv_main.AT_bb_F_1 != 0)) && !((!hbv_main.AT_bb_D_2 || !hbv_main.AT_bb_E_3) && hbv_main.AT_bb_D_2)) && !((hbv_main.AT_bb_C_6 != 1 && hbv_main.AT_bb_D_2) && hbv_main.AT_bb_E_3)) && hbv_main.AT_bb_B_4 == hbv_main.AT_bb_A_5) && !!hbv_main.AT_bb_D_2;
      VAL   [hbv_main.AT_bb_B_4=9, hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=0, hhv_main.AT_bb_I_2=1]
[L0]  CALL  call main.ATentry(hbv_main.AT_bb_B_4);
[L0]  RET   call main.ATentry(hbv_main.AT_bb_B_4);
      VAL   [hbv_main.AT_bb_B_4=9, hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=0, hhv_main.AT_bb_I_2=1]
[L0]  RET   call main.AT_bb(hhv_main.AT_bb_G_0, hbv_main.AT_bb_C_10, hbv_main.AT_bb_A_5);
      VAL   [hbv_main.AT_bb_A_5=1, hbv_main.AT_bb_C_10=0, hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=2, hhv_main.AT_bb_I_2=2]
[L0]  RET   call main.AT_bb(hhv_main.AT_bb_G_0, hbv_main.AT_bb_C_10, hbv_main.AT_bb_A_5);
      VAL   [hbv_main.AT_bb_A_5=2, hbv_main.AT_bb_C_10=2, hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=4, hhv_main.AT_bb_I_2=3]
[L0]  RET   call main.AT_bb(hhv_main.AT_bb_G_0, hbv_main.AT_bb_C_10, hbv_main.AT_bb_A_5);
      VAL   [hbv_main.AT_bb_A_5=3, hbv_main.AT_bb_C_10=4, hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=6, hhv_main.AT_bb_I_2=4]
[L0]  RET   call main.AT_bb(hhv_main.AT_bb_G_0, hbv_main.AT_bb_C_10, hbv_main.AT_bb_A_5);
      VAL   [hbv_main.AT_bb_A_5=4, hbv_main.AT_bb_C_10=6, hhv_main.AT_bb_G_0=4, hhv_main.AT_bb_H_1=-10, hhv_main.AT_bb_I_2=5]
[L0]  RET   call main.AT_bb(hbv_main.ATverifier.error.split_D_2, hbv_main.ATverifier.error.split_F_9, hbv_main.ATverifier.error.split_A_1);
      VAL   [hbv_main.ATverifier.error.split_A_1=5, hbv_main.ATverifier.error.split_D_2=4, hbv_main.ATverifier.error.split_F_9=-10]
[L0]  RET   call main.ATverifier.error.split();
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 19 locations, 25 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 255 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 53 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=3, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 803 SizeOfPredicates, 48 NumberOfNonLiveVariables, 206 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 22/72 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:22:01,050 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
unsat
