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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:21,589 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:21,702 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff4c7f-ec46-4667-8aa8-4e7e578b12d3/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:21,712 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:21,713 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:21,747 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:21,748 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:21,748 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:21,749 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:21,750 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:21,751 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:21,752 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:21,752 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:21,752 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:21,752 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:21,752 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:21,752 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:21,752 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:21,753 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:21,753 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:21,753 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:21,754 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:21,754 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:21,754 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:21,754 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:21,755 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:21,755 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:22,096 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:22,106 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:22,110 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:22,113 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:22,114 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:22,115 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff4c7f-ec46-4667-8aa8-4e7e578b12d3/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-014.smt2
[2025-04-28 21:21:22,117 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:22,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:22,443 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff4c7f-ec46-4667-8aa8-4e7e578b12d3/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-014.smt2
[2025-04-28 21:21:22,447 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:22,450 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:22,452 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:22,452 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:22,452 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:22,455 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:22" (1/1) ...
[2025-04-28 21:21:22,488 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:22 Unit
[2025-04-28 21:21:22,488 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:22,496 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:22,496 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:22,496 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:22,518 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:22" (1/1) ...
[2025-04-28 21:21:22,518 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:22" (1/1) ...
[2025-04-28 21:21:22,551 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:22" (1/1) ...
[2025-04-28 21:21:22,551 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:22" (1/1) ...
[2025-04-28 21:21:22,556 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:22" (1/1) ...
[2025-04-28 21:21:22,561 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:22" (1/1) ...
[2025-04-28 21:21:22,563 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:22" (1/1) ...
[2025-04-28 21:21:22,568 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:22" (1/1) ...
[2025-04-28 21:21:22,569 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:22" (1/1) ...
[2025-04-28 21:21:22,591 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:22,593 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:22,594 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:22,594 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:22,595 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:22" (1/1) ...
[2025-04-28 21:21:22,599 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:22,612 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:22,624 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:22,628 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:22,641 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:22,641 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:22,642 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:22,642 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATverifier.error.split given in one single declaration
[2025-04-28 21:21:22,642 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATverifier.error.split
[2025-04-28 21:21:22,642 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATverifier.error.split
[2025-04-28 21:21:22,642 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure linear_search given in one single declaration
[2025-04-28 21:21:22,642 INFO  L130     BoogieDeclarations]: Found specification of procedure linear_search
[2025-04-28 21:21:22,642 INFO  L138     BoogieDeclarations]: Found implementation of procedure linear_search
[2025-04-28 21:21:22,642 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure linear_search.AT.critedge.split given in one single declaration
[2025-04-28 21:21:22,644 INFO  L130     BoogieDeclarations]: Found specification of procedure linear_search.AT.critedge.split
[2025-04-28 21:21:22,645 INFO  L138     BoogieDeclarations]: Found implementation of procedure linear_search.AT.critedge.split
[2025-04-28 21:21:22,645 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure linear_search.AT_j.0 given in one single declaration
[2025-04-28 21:21:22,645 INFO  L130     BoogieDeclarations]: Found specification of procedure linear_search.AT_j.0
[2025-04-28 21:21:22,645 INFO  L138     BoogieDeclarations]: Found implementation of procedure linear_search.AT_j.0
[2025-04-28 21:21:22,645 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure linear_search.AT_1 given in one single declaration
[2025-04-28 21:21:22,645 INFO  L130     BoogieDeclarations]: Found specification of procedure linear_search.AT_1
[2025-04-28 21:21:22,646 INFO  L138     BoogieDeclarations]: Found implementation of procedure linear_search.AT_1
[2025-04-28 21:21:22,646 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-04-28 21:21:22,646 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-04-28 21:21:22,647 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-04-28 21:21:22,647 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:22,647 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:22,647 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:22,709 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:22,712 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:22,894 INFO  L?                        ?]: Removed 50 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:22,894 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:22,907 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:22,907 INFO  L312             CfgBuilder]: Removed 3 assume(true) statements.
[2025-04-28 21:21:22,907 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:22 BoogieIcfgContainer
[2025-04-28 21:21:22,908 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:22,911 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:22,911 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:22,915 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:22,915 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:22" (1/3) ...
[2025-04-28 21:21:22,916 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355c05d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:22, skipping insertion in model container
[2025-04-28 21:21:22,916 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:22" (2/3) ...
[2025-04-28 21:21:22,916 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355c05d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:22, skipping insertion in model container
[2025-04-28 21:21:22,917 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:22" (3/3) ...
[2025-04-28 21:21:22,918 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:22,935 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:22,938 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 8 procedures, 30 locations, 42 edges, 8 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:22,979 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:22,994 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;@538a2619, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:22,994 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:22,999 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 30 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2025-04-28 21:21:23,007 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-04-28 21:21:23,008 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:23,008 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:23,009 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:23,017 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:23,018 INFO  L85        PathProgramCache]: Analyzing trace with hash 794883415, now seen corresponding path program 1 times
[2025-04-28 21:21:23,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:23,027 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199665709]
[2025-04-28 21:21:23,028 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:23,028 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:23,076 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-04-28 21:21:23,108 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-04-28 21:21:23,108 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:23,109 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:23,347 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:23,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:23,348 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199665709]
[2025-04-28 21:21:23,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199665709] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:23,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:23,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:23,359 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562773941]
[2025-04-28 21:21:23,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:23,368 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:23,368 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:23,403 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:23,404 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:23,406 INFO  L87              Difference]: Start difference. First operand  has 30 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:23,469 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:23,470 INFO  L93              Difference]: Finished difference Result 30 states and 33 transitions.
[2025-04-28 21:21:23,471 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:23,473 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 15
[2025-04-28 21:21:23,474 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:23,483 INFO  L225             Difference]: With dead ends: 30
[2025-04-28 21:21:23,484 INFO  L226             Difference]: Without dead ends: 28
[2025-04-28 21:21:23,486 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:23,492 INFO  L437           NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:23,496 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 87 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:23,560 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2025-04-28 21:21:23,584 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2025-04-28 21:21:23,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2025-04-28 21:21:23,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions.
[2025-04-28 21:21:23,593 INFO  L79                 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 15
[2025-04-28 21:21:23,593 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:23,593 INFO  L485      AbstractCegarLoop]: Abstraction has 28 states and 30 transitions.
[2025-04-28 21:21:23,594 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:23,594 INFO  L278                IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions.
[2025-04-28 21:21:23,595 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-04-28 21:21:23,596 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:23,596 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:23,596 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:23,597 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:23,599 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:23,599 INFO  L85        PathProgramCache]: Analyzing trace with hash -2005507712, now seen corresponding path program 1 times
[2025-04-28 21:21:23,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:23,600 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902164646]
[2025-04-28 21:21:23,600 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:23,600 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:23,618 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-04-28 21:21:23,635 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-04-28 21:21:23,635 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:23,635 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:23,784 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:23,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:23,784 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902164646]
[2025-04-28 21:21:23,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902164646] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:23,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:23,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:23,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38676822]
[2025-04-28 21:21:23,785 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:23,786 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:23,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:23,788 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:23,788 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:23,788 INFO  L87              Difference]: Start difference. First operand 28 states and 30 transitions. Second operand  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:23,807 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:23,808 INFO  L93              Difference]: Finished difference Result 30 states and 31 transitions.
[2025-04-28 21:21:23,808 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:23,809 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 15
[2025-04-28 21:21:23,809 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:23,810 INFO  L225             Difference]: With dead ends: 30
[2025-04-28 21:21:23,810 INFO  L226             Difference]: Without dead ends: 28
[2025-04-28 21:21:23,810 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:23,812 INFO  L437           NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:23,813 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:23,815 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2025-04-28 21:21:23,821 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2025-04-28 21:21:23,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8)
[2025-04-28 21:21:23,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions.
[2025-04-28 21:21:23,824 INFO  L79                 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15
[2025-04-28 21:21:23,825 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:23,825 INFO  L485      AbstractCegarLoop]: Abstraction has 28 states and 29 transitions.
[2025-04-28 21:21:23,825 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:23,825 INFO  L278                IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions.
[2025-04-28 21:21:23,826 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2025-04-28 21:21:23,827 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:23,827 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:23,827 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:23,828 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:23,828 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:23,829 INFO  L85        PathProgramCache]: Analyzing trace with hash -1882998876, now seen corresponding path program 1 times
[2025-04-28 21:21:23,829 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:23,829 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95670941]
[2025-04-28 21:21:23,830 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:23,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:23,853 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-04-28 21:21:23,911 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-04-28 21:21:23,911 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:23,911 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:23,911 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:23,918 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-04-28 21:21:23,950 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-04-28 21:21:23,953 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:23,953 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:24,011 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:24,012 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:24,015 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:24,018 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:24,027 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2025-04-28 21:21:24,041 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:24,044 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:24 BoogieIcfgContainer
[2025-04-28 21:21:24,044 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:24,045 INFO  L158              Benchmark]: Toolchain (without parser) took 1595.05ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 160.9MB in the beginning and 131.1MB in the end (delta: 29.7MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:24,045 INFO  L158              Benchmark]: SmtParser took 0.41ms. Allocated memory is still 234.9MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:24,046 INFO  L158              Benchmark]: ChcToBoogie took 43.96ms. Allocated memory is still 234.9MB. Free memory was 160.9MB in the beginning and 159.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:24,046 INFO  L158              Benchmark]: Boogie Preprocessor took 95.46ms. Allocated memory is still 234.9MB. Free memory was 159.4MB in the beginning and 156.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:24,046 INFO  L158              Benchmark]: RCFGBuilder took 314.44ms. Allocated memory is still 234.9MB. Free memory was 156.5MB in the beginning and 143.6MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:24,047 INFO  L158              Benchmark]: TraceAbstraction took 1132.83ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 142.9MB in the beginning and 131.1MB in the end (delta: 11.7MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:24,048 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.41ms. Allocated memory is still 234.9MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 43.96ms. Allocated memory is still 234.9MB. Free memory was 160.9MB in the beginning and 159.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 95.46ms. Allocated memory is still 234.9MB. Free memory was 159.4MB in the beginning and 156.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 314.44ms. Allocated memory is still 234.9MB. Free memory was 156.5MB in the beginning and 143.6MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 1132.83ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 142.9MB in the beginning and 131.1MB in the end (delta: 11.7MB). 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_X_11 && (!hbv_main.ATverifier.error.split_W_27 || !hbv_main.ATverifier.error.split_X_11)) && !!hbv_main.ATverifier.error.split_Y_10) && hbv_main.ATverifier.error.split_N_1 + hbv_main.ATverifier.error.split_G_23 * 4 == hbv_main.ATverifier.error.split_I_2) && hbv_main.ATverifier.error.split_H_24[hbv_main.ATverifier.error.split_I_2 := 3] == hbv_main.ATverifier.error.split_J_25) && !hbv_main.ATverifier.error.split_Q_17) && !hbv_main.ATverifier.error.split_v_26_18) && !(hbv_main.ATverifier.error.split_N_1 <= 0)) && !((!hbv_main.ATverifier.error.split_Y_10 || !hbv_main.ATverifier.error.split_X_11) && hbv_main.ATverifier.error.split_Y_10)) && !(0 < hbv_main.ATverifier.error.split_N_1 && hbv_main.ATverifier.error.split_I_2 <= 0)) && hbv_main.ATverifier.error.split_C_12 == hbv_main.ATverifier.error.split_B_13) && !((!hbv_main.ATverifier.error.split_S_3 || !hbv_main.ATverifier.error.split_V_8) && hbv_main.ATverifier.error.split_V_8)) && hbv_main.ATverifier.error.split_L_20[hbv_main.ATverifier.error.split_P_6] == hbv_main.ATverifier.error.split_O_26) && !((!hbv_main.ATverifier.error.split_W_27 || !hbv_main.ATverifier.error.split_V_8) && hbv_main.ATverifier.error.split_W_27)) && !!hbv_main.ATverifier.error.split_v_25_9) && 3 == hbv_main.ATverifier.error.split_v_28_22) && !(((hbv_main.ATverifier.error.split_T_14 == 0 || hbv_main.ATverifier.error.split_U_15) && hbv_main.ATverifier.error.split_V_8) && (hbv_main.ATverifier.error.split_T_14 != 0 || !hbv_main.ATverifier.error.split_U_15))) && hbv_main.ATverifier.error.split_F_19 == hbv_main.ATverifier.error.split_D_21 + 1) && hbv_main.ATverifier.error.split_A_5[hbv_main.ATverifier.error.split_P_6 := 0] == hbv_main.ATverifier.error.split_E_7) && !(hbv_main.ATverifier.error.split_S_3 && (!hbv_main.ATverifier.error.split_S_3 || !hbv_main.ATverifier.error.split_R_4))) && !(hbv_main.ATverifier.error.split_V_8 && !hbv_main.ATverifier.error.split_U_15)) && hbv_main.ATverifier.error.split_E_7[hbv_main.ATverifier.error.split_P_6 := hbv_main.ATverifier.error.split_F_19] == hbv_main.ATverifier.error.split_L_20) && !hbv_main.ATverifier.error.split_v_27_16;
      VAL   [hbv_main.ATverifier.error.split_C_12=6, hbv_main.ATverifier.error.split_N_1=1, hbv_main.ATverifier.error.split_O_26=0, hbv_main.ATverifier.error.split_P_6=7, hbv_main.ATverifier.error.split_T_14=0, hbv_main.ATverifier.error.split_v_25_9=true, hbv_main.ATverifier.error.split_v_26_18=false, hbv_main.ATverifier.error.split_v_27_16=false, hbv_main.ATverifier.error.split_v_28_22=3]
[L0]  CALL  call main.ATentry(hbv_main.ATverifier.error.split_A_5, hbv_main.ATverifier.error.split_C_12);
[L0]  RET   call main.ATentry(hbv_main.ATverifier.error.split_A_5, hbv_main.ATverifier.error.split_C_12);
      VAL   [hbv_main.ATverifier.error.split_C_12=6, hbv_main.ATverifier.error.split_N_1=1, hbv_main.ATverifier.error.split_O_26=0, hbv_main.ATverifier.error.split_P_6=7, hbv_main.ATverifier.error.split_T_14=0, hbv_main.ATverifier.error.split_v_25_9=true, hbv_main.ATverifier.error.split_v_26_18=false, hbv_main.ATverifier.error.split_v_27_16=false, hbv_main.ATverifier.error.split_v_28_22=3]
[L0]  CALL  call linear_search(hbv_main.ATverifier.error.split_v_25_9, hbv_main.ATverifier.error.split_v_26_18, hbv_main.ATverifier.error.split_v_27_16, hbv_main.ATverifier.error.split_J_25, hbv_main.ATverifier.error.split_K_28, hbv_main.ATverifier.error.split_L_20, hbv_main.ATverifier.error.split_M_29, hbv_main.ATverifier.error.split_N_1, hbv_main.ATverifier.error.split_O_26, hbv_main.ATverifier.error.split_v_28_22, hbv_main.ATverifier.error.split_P_6, hbv_main.ATverifier.error.split_T_14);
      VAL   [hhv_linear_search_C_7=1, hhv_linear_search_D_8=0, hhv_linear_search_E_9=3, hhv_linear_search_F_10=7, hhv_linear_search_G_11=0, hhv_linear_search_v_7_0=true, hhv_linear_search_v_8_1=false, hhv_linear_search_v_9_2=false]
[L0]        assume (((hhv_linear_search_v_10_4 == hhv_linear_search_A_3 && !hhv_linear_search_v_9_2) && !!hhv_linear_search_v_7_0) && hhv_linear_search_v_11_6 == hhv_linear_search_B_5) && !hhv_linear_search_v_8_1;
      VAL   [hhv_linear_search_C_7=1, hhv_linear_search_D_8=0, hhv_linear_search_E_9=3, hhv_linear_search_F_10=7, hhv_linear_search_G_11=0, hhv_linear_search_v_7_0=true, hhv_linear_search_v_8_1=false, hhv_linear_search_v_9_2=false]
[L0]  CALL  call linear_search.AT.critedge.split(hhv_linear_search_A_3, hhv_linear_search_B_5, hhv_linear_search_G_11, hhv_linear_search_F_10, hhv_linear_search_C_7, hhv_linear_search_E_9, hhv_linear_search_D_8);
      VAL   [hhv_linear_search.AT.critedge.split_P_2=0, hhv_linear_search.AT.critedge.split_Q_3=7, hhv_linear_search.AT.critedge.split_R_4=1, hhv_linear_search.AT.critedge.split_S_5=3, hhv_linear_search.AT.critedge.split_T_6=0]
[L0]        assume ((((((((((((((((!!hbv_linear_search.AT.critedge.split_M_6 && !(hbv_linear_search.AT.critedge.split_J_7 != hhv_linear_search.AT.critedge.split_O_1[hhv_linear_search.AT.critedge.split_Q_3] && hbv_linear_search.AT.critedge.split_L_5)) && !((hbv_linear_search.AT.critedge.split_L_5 && ((!hbv_linear_search.AT.critedge.split_K_13 || ((hbv_linear_search.AT.critedge.split_J_7 <= hbv_linear_search.AT.critedge.split_I_8 || 0 <= hbv_linear_search.AT.critedge.split_J_7) && hbv_linear_search.AT.critedge.split_I_8 < 0)) || ((hbv_linear_search.AT.critedge.split_J_7 <= hbv_linear_search.AT.critedge.split_I_8 && 0 <= hbv_linear_search.AT.critedge.split_J_7) && 0 <= hbv_linear_search.AT.critedge.split_I_8))) && ((((hbv_linear_search.AT.critedge.split_I_8 < hbv_linear_search.AT.critedge.split_J_7 && hbv_linear_search.AT.critedge.split_J_7 < 0) || 0 <= hbv_linear_search.AT.critedge.split_I_8) && ((hbv_linear_search.AT.critedge.split_I_8 < hbv_linear_search.AT.critedge.split_J_7 || hbv_linear_search.AT.critedge.split_J_7 < 0) || hbv_linear_search.AT.critedge.split_I_8 < 0)) || hbv_linear_search.AT.critedge.split_K_13))) && !((!hbv_linear_search.AT.critedge.split_L_5 || !hbv_linear_search.AT.critedge.split_M_6) && hbv_linear_search.AT.critedge.split_M_6)) && !(hbv_linear_search.AT.critedge.split_A_9 != hhv_linear_search.AT.critedge.split_R_4 + hbv_linear_search.AT.critedge.split_I_8 * 4 && hbv_linear_search.AT.critedge.split_C_4)) && !((hbv_linear_search.AT.critedge.split_C_4 && hbv_linear_search.AT.critedge.split_D_3) && !hbv_linear_search.AT.critedge.split_E_10)) && !(hbv_linear_search.AT.critedge.split_L_5 && (if hbv_linear_search.AT.critedge.split_K_13 then 1 else 0) != hhv_linear_search.AT.critedge.split_P_2)) && !(hbv_linear_search.AT.critedge.split_C_4 && hhv_linear_search.AT.critedge.split_R_4 <= 0)) && !((hbv_linear_search.AT.critedge.split_H_11 && hbv_linear_search.AT.critedge.split_F_1) && hbv_linear_search.AT.critedge.split_G_2)) && !(hbv_linear_search.AT.critedge.split_C_4 && hhv_linear_search.AT.critedge.split_N_0[hbv_linear_search.AT.critedge.split_A_9] != hbv_linear_search.AT.critedge.split_B_12)) && !((!hbv_linear_search.AT.critedge.split_H_11 && hbv_linear_search.AT.critedge.split_C_4) && hbv_linear_search.AT.critedge.split_F_1)) && !(((hbv_linear_search.AT.critedge.split_B_12 != hhv_linear_search.AT.critedge.split_S_5 || !hbv_linear_search.AT.critedge.split_E_10) && hbv_linear_search.AT.critedge.split_C_4) && (hbv_linear_search.AT.critedge.split_E_10 || hbv_linear_search.AT.critedge.split_B_12 == hhv_linear_search.AT.critedge.split_S_5))) && !(hbv_linear_search.AT.critedge.split_D_3 && !hbv_linear_search.AT.critedge.split_C_4)) && !((!hbv_linear_search.AT.critedge.split_F_1 || !hbv_linear_search.AT.critedge.split_C_4) && hbv_linear_search.AT.critedge.split_C_4)) && !(!hbv_linear_search.AT.critedge.split_F_1 && hbv_linear_search.AT.critedge.split_G_2)) && !(((((hhv_linear_search.AT.critedge.split_T_6 < 0 && hbv_linear_search.AT.critedge.split_I_8 < hhv_linear_search.AT.critedge.split_T_6) || 0 <= hbv_linear_search.AT.critedge.split_I_8) && ((hhv_linear_search.AT.critedge.split_T_6 < 0 || hbv_linear_search.AT.critedge.split_I_8 < 0) || hbv_linear_search.AT.critedge.split_I_8 < hhv_linear_search.AT.critedge.split_T_6)) || hbv_linear_search.AT.critedge.split_H_11) && ((!hbv_linear_search.AT.critedge.split_H_11 || ((0 <= hhv_linear_search.AT.critedge.split_T_6 || hhv_linear_search.AT.critedge.split_T_6 <= hbv_linear_search.AT.critedge.split_I_8) && hbv_linear_search.AT.critedge.split_I_8 < 0)) || ((0 <= hhv_linear_search.AT.critedge.split_T_6 && 0 <= hbv_linear_search.AT.critedge.split_I_8) && hhv_linear_search.AT.critedge.split_T_6 <= hbv_linear_search.AT.critedge.split_I_8)))) && !((hbv_linear_search.AT.critedge.split_A_9 <= 0 && hbv_linear_search.AT.critedge.split_C_4) && 0 < hhv_linear_search.AT.critedge.split_R_4)) && !(((!hbv_linear_search.AT.critedge.split_F_1 || !hbv_linear_search.AT.critedge.split_G_2) && (!hbv_linear_search.AT.critedge.split_D_3 || !hbv_linear_search.AT.critedge.split_C_4)) && hbv_linear_search.AT.critedge.split_L_5);
      VAL   [hbv_linear_search.AT.critedge.split_I_8=0, hhv_linear_search.AT.critedge.split_P_2=0, hhv_linear_search.AT.critedge.split_Q_3=7, hhv_linear_search.AT.critedge.split_R_4=1, hhv_linear_search.AT.critedge.split_S_5=3, hhv_linear_search.AT.critedge.split_T_6=0]
[L0]  CALL  call linear_search.AT_j.0(hhv_linear_search.AT.critedge.split_N_0, hhv_linear_search.AT.critedge.split_O_1, hhv_linear_search.AT.critedge.split_Q_3, hbv_linear_search.AT.critedge.split_I_8, hhv_linear_search.AT.critedge.split_R_4, hhv_linear_search.AT.critedge.split_S_5, hhv_linear_search.AT.critedge.split_T_6);
      VAL   [hhv_linear_search.AT_j.0_F_2=7, hhv_linear_search.AT_j.0_G_3=0, hhv_linear_search.AT_j.0_H_4=1, hhv_linear_search.AT_j.0_I_5=3, hhv_linear_search.AT_j.0_J_6=0]
[L0]        assume ((!!hbv_linear_search.AT_j.0_A_3 && !(hbv_linear_search.AT_j.0_A_3 && (!hbv_linear_search.AT_j.0_B_2 || !hbv_linear_search.AT_j.0_A_3))) && !((hbv_linear_search.AT_j.0_C_1 != 0 && hbv_linear_search.AT_j.0_B_2) && hbv_linear_search.AT_j.0_A_3)) && !((hbv_linear_search.AT_j.0_B_2 && hbv_linear_search.AT_j.0_A_3) && hhv_linear_search.AT_j.0_G_3 != hbv_linear_search.AT_j.0_C_1);
      VAL   [hhv_linear_search.AT_j.0_F_2=7, hhv_linear_search.AT_j.0_G_3=0, hhv_linear_search.AT_j.0_H_4=1, hhv_linear_search.AT_j.0_I_5=3, hhv_linear_search.AT_j.0_J_6=0]
[L0]  CALL  call linear_search.AT_1(hhv_linear_search.AT_j.0_D_0, hhv_linear_search.AT_j.0_E_1, hhv_linear_search.AT_j.0_F_2, hhv_linear_search.AT_j.0_H_4, hhv_linear_search.AT_j.0_I_5, hhv_linear_search.AT_j.0_J_6);
[L0]  RET   call linear_search.AT_1(hhv_linear_search.AT_j.0_D_0, hhv_linear_search.AT_j.0_E_1, hhv_linear_search.AT_j.0_F_2, hhv_linear_search.AT_j.0_H_4, hhv_linear_search.AT_j.0_I_5, hhv_linear_search.AT_j.0_J_6);
      VAL   [hhv_linear_search.AT_j.0_F_2=7, hhv_linear_search.AT_j.0_G_3=0, hhv_linear_search.AT_j.0_H_4=1, hhv_linear_search.AT_j.0_I_5=3, hhv_linear_search.AT_j.0_J_6=0]
[L0]  RET   call linear_search.AT_j.0(hhv_linear_search.AT.critedge.split_N_0, hhv_linear_search.AT.critedge.split_O_1, hhv_linear_search.AT.critedge.split_Q_3, hbv_linear_search.AT.critedge.split_I_8, hhv_linear_search.AT.critedge.split_R_4, hhv_linear_search.AT.critedge.split_S_5, hhv_linear_search.AT.critedge.split_T_6);
      VAL   [hbv_linear_search.AT.critedge.split_I_8=0, hhv_linear_search.AT.critedge.split_P_2=0, hhv_linear_search.AT.critedge.split_Q_3=7, hhv_linear_search.AT.critedge.split_R_4=1, hhv_linear_search.AT.critedge.split_S_5=3, hhv_linear_search.AT.critedge.split_T_6=0]
[L0]  RET   call linear_search.AT.critedge.split(hhv_linear_search_A_3, hhv_linear_search_B_5, hhv_linear_search_G_11, hhv_linear_search_F_10, hhv_linear_search_C_7, hhv_linear_search_E_9, hhv_linear_search_D_8);
      VAL   [hhv_linear_search_C_7=1, hhv_linear_search_D_8=0, hhv_linear_search_E_9=3, hhv_linear_search_F_10=7, hhv_linear_search_G_11=0, hhv_linear_search_v_7_0=true, hhv_linear_search_v_8_1=false, hhv_linear_search_v_9_2=false]
[L0]  RET   call linear_search(hbv_main.ATverifier.error.split_v_25_9, hbv_main.ATverifier.error.split_v_26_18, hbv_main.ATverifier.error.split_v_27_16, hbv_main.ATverifier.error.split_J_25, hbv_main.ATverifier.error.split_K_28, hbv_main.ATverifier.error.split_L_20, hbv_main.ATverifier.error.split_M_29, hbv_main.ATverifier.error.split_N_1, hbv_main.ATverifier.error.split_O_26, hbv_main.ATverifier.error.split_v_28_22, hbv_main.ATverifier.error.split_P_6, hbv_main.ATverifier.error.split_T_14);
      VAL   [hbv_main.ATverifier.error.split_C_12=6, hbv_main.ATverifier.error.split_N_1=1, hbv_main.ATverifier.error.split_O_26=0, hbv_main.ATverifier.error.split_P_6=7, hbv_main.ATverifier.error.split_T_14=0, hbv_main.ATverifier.error.split_v_25_9=true, hbv_main.ATverifier.error.split_v_26_18=false, hbv_main.ATverifier.error.split_v_27_16=false, hbv_main.ATverifier.error.split_v_28_22=3]
[L0]  RET   call main.ATverifier.error.split();
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 8 procedures, 30 locations, 42 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 62 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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:24,064 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
