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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:37,403 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:37,487 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ce9e0df-e73d-4516-ae11-b1331c406838/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:37,494 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:37,495 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:37,517 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:37,518 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:37,518 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:37,518 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:37,519 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:37,519 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:37,519 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:37,519 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:37,519 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:37,519 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:37,519 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:37,520 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:37,520 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:37,520 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:37,520 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:37,520 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:37,520 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:37,520 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:37,520 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:37,520 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:37,521 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:37,521 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:37,868 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:37,882 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:37,886 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:37,887 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:37,888 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:37,891 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ce9e0df-e73d-4516-ae11-b1331c406838/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-016.smt2
[2025-04-28 21:21:37,894 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:37,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:38,167 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ce9e0df-e73d-4516-ae11-b1331c406838/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-016.smt2
[2025-04-28 21:21:38,170 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:38,171 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:38,172 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:38,172 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:38,173 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:38,177 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,217 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38 Unit
[2025-04-28 21:21:38,217 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:38,218 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:38,219 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:38,219 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:38,240 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,240 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,275 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,280 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,282 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,288 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,290 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,294 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,295 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,327 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:38,328 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:38,328 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:38,328 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:38,329 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,332 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:38,345 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:38,359 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:38,363 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:38,377 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:38,377 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:38,378 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:38,378 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATorig.main.exit.split given in one single declaration
[2025-04-28 21:21:38,378 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATorig.main.exit.split
[2025-04-28 21:21:38,378 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATorig.main.exit.split
[2025-04-28 21:21:38,378 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-04-28 21:21:38,378 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-04-28 21:21:38,378 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-04-28 21:21:38,378 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT.lr.ph given in one single declaration
[2025-04-28 21:21:38,379 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT.lr.ph
[2025-04-28 21:21:38,379 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT.lr.ph
[2025-04-28 21:21:38,379 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:38,379 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:38,379 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:38,457 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:38,459 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:38,654 INFO  L?                        ?]: Removed 37 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:38,654 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:38,669 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:38,674 INFO  L312             CfgBuilder]: Removed 2 assume(true) statements.
[2025-04-28 21:21:38,674 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:38 BoogieIcfgContainer
[2025-04-28 21:21:38,674 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:38,681 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:38,681 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:38,686 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:38,686 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:38" (1/3) ...
[2025-04-28 21:21:38,687 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df3256c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:38, skipping insertion in model container
[2025-04-28 21:21:38,688 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (2/3) ...
[2025-04-28 21:21:38,688 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df3256c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:38, skipping insertion in model container
[2025-04-28 21:21:38,688 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:38" (3/3) ...
[2025-04-28 21:21:38,690 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:38,708 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:38,712 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 5 procedures, 20 locations, 29 edges, 5 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:38,768 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:38,786 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;@e28df91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:38,786 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:38,791 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 20 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6)
[2025-04-28 21:21:38,799 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2025-04-28 21:21:38,800 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,800 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:38,801 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,807 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,807 INFO  L85        PathProgramCache]: Analyzing trace with hash 254962032, now seen corresponding path program 1 times
[2025-04-28 21:21:38,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,823 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309956076]
[2025-04-28 21:21:38,824 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,853 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes.
[2025-04-28 21:21:38,857 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements.
[2025-04-28 21:21:38,857 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,858 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,903 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:38,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:38,904 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309956076]
[2025-04-28 21:21:38,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309956076] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:38,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:38,913 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-04-28 21:21:38,915 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158711696]
[2025-04-28 21:21:38,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:38,923 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-04-28 21:21:38,924 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:38,965 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-04-28 21:21:38,967 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-04-28 21:21:38,971 INFO  L87              Difference]: Start difference. First operand  has 20 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand  has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:21:38,996 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:38,997 INFO  L93              Difference]: Finished difference Result 17 states and 18 transitions.
[2025-04-28 21:21:38,998 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-04-28 21:21:38,999 INFO  L79                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 11
[2025-04-28 21:21:39,000 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,009 INFO  L225             Difference]: With dead ends: 17
[2025-04-28 21:21:39,010 INFO  L226             Difference]: Without dead ends: 17
[2025-04-28 21:21:39,013 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-04-28 21:21:39,021 INFO  L437           NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,024 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:39,041 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17 states.
[2025-04-28 21:21:39,067 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17.
[2025-04-28 21:21:39,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 8 states have internal predecessors, (8), 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:39,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions.
[2025-04-28 21:21:39,079 INFO  L79                 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11
[2025-04-28 21:21:39,080 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,080 INFO  L485      AbstractCegarLoop]: Abstraction has 17 states and 18 transitions.
[2025-04-28 21:21:39,080 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:21:39,081 INFO  L278                IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions.
[2025-04-28 21:21:39,084 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-04-28 21:21:39,085 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,085 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:39,085 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:39,086 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,086 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,087 INFO  L85        PathProgramCache]: Analyzing trace with hash -1459687376, now seen corresponding path program 1 times
[2025-04-28 21:21:39,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,088 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551283588]
[2025-04-28 21:21:39,088 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,105 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-04-28 21:21:39,158 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-04-28 21:21:39,160 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,160 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,957 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:39,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,958 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551283588]
[2025-04-28 21:21:39,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551283588] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:39,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:39,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:39,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589346873]
[2025-04-28 21:21:39,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,959 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:39,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,960 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:39,962 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:39,962 INFO  L87              Difference]: Start difference. First operand 17 states and 18 transitions. 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:39,986 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,986 INFO  L93              Difference]: Finished difference Result 19 states and 20 transitions.
[2025-04-28 21:21:39,988 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:39,989 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:39,989 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,990 INFO  L225             Difference]: With dead ends: 19
[2025-04-28 21:21:39,990 INFO  L226             Difference]: Without dead ends: 19
[2025-04-28 21:21:39,991 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:39,992 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:39,992 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:39,993 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2025-04-28 21:21:40,004 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2025-04-28 21:21:40,004 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:40,005 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions.
[2025-04-28 21:21:40,005 INFO  L79                 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15
[2025-04-28 21:21:40,006 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,010 INFO  L485      AbstractCegarLoop]: Abstraction has 19 states and 20 transitions.
[2025-04-28 21:21:40,010 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:40,010 INFO  L278                IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions.
[2025-04-28 21:21:40,011 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-28 21:21:40,011 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,011 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:40,011 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:40,011 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,012 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,012 INFO  L85        PathProgramCache]: Analyzing trace with hash 690644848, now seen corresponding path program 1 times
[2025-04-28 21:21:40,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,012 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207118298]
[2025-04-28 21:21:40,012 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,034 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:40,057 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:40,057 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,057 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,700 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:40,702 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,702 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207118298]
[2025-04-28 21:21:40,702 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207118298] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:40,702 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220551001]
[2025-04-28 21:21:40,702 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,703 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:40,706 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:40,710 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:40,712 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:40,778 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:40,805 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:40,806 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,806 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,809 WARN  L254         TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 48 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:40,815 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:41,344 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:41,344 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:43,201 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:43,202 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [220551001] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:43,202 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:43,203 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12
[2025-04-28 21:21:43,203 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072624776]
[2025-04-28 21:21:43,203 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:43,204 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-04-28 21:21:43,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:43,206 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-04-28 21:21:43,207 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:43,208 INFO  L87              Difference]: Start difference. First operand 19 states and 20 transitions. Second operand  has 12 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 12 states have internal predecessors, (16), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (10), 5 states have call predecessors, (10), 9 states have call successors, (10)
[2025-04-28 21:21:43,384 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:43,385 INFO  L93              Difference]: Finished difference Result 21 states and 22 transitions.
[2025-04-28 21:21:43,386 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:43,387 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 12 states have internal predecessors, (16), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (10), 5 states have call predecessors, (10), 9 states have call successors, (10) Word has length 19
[2025-04-28 21:21:43,388 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:43,388 INFO  L225             Difference]: With dead ends: 21
[2025-04-28 21:21:43,388 INFO  L226             Difference]: Without dead ends: 21
[2025-04-28 21:21:43,390 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:43,391 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:43,393 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:43,393 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2025-04-28 21:21:43,397 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2025-04-28 21:21:43,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7)
[2025-04-28 21:21:43,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions.
[2025-04-28 21:21:43,399 INFO  L79                 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19
[2025-04-28 21:21:43,399 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:43,399 INFO  L485      AbstractCegarLoop]: Abstraction has 21 states and 22 transitions.
[2025-04-28 21:21:43,399 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 12 states have internal predecessors, (16), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (10), 5 states have call predecessors, (10), 9 states have call successors, (10)
[2025-04-28 21:21:43,400 INFO  L278                IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions.
[2025-04-28 21:21:43,400 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2025-04-28 21:21:43,400 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:43,401 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:43,407 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:43,601 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:43,601 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:43,602 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:43,602 INFO  L85        PathProgramCache]: Analyzing trace with hash 251031344, now seen corresponding path program 2 times
[2025-04-28 21:21:43,602 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:43,602 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681145178]
[2025-04-28 21:21:43,602 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:43,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:43,612 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes.
[2025-04-28 21:21:43,634 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements.
[2025-04-28 21:21:43,636 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:43,636 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:44,239 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:44,239 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681145178]
[2025-04-28 21:21:44,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681145178] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:44,239 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508774139]
[2025-04-28 21:21:44,239 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:44,239 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,242 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:44,244 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:44,247 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:44,301 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes.
[2025-04-28 21:21:44,331 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements.
[2025-04-28 21:21:44,331 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:44,331 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,333 WARN  L254         TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 65 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:44,338 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:44,755 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:44,755 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:47,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:47,499 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508774139] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:47,499 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:47,499 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16
[2025-04-28 21:21:47,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544744488]
[2025-04-28 21:21:47,499 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:47,500 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-04-28 21:21:47,500 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:47,507 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-04-28 21:21:47,507 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:47,508 INFO  L87              Difference]: Start difference. First operand 21 states and 22 transitions. Second operand  has 16 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 11 states have call successors, (12)
[2025-04-28 21:21:47,692 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:47,692 INFO  L93              Difference]: Finished difference Result 23 states and 24 transitions.
[2025-04-28 21:21:47,692 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:47,693 INFO  L79                 Accepts]: Start accepts. Automaton has  has 16 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 11 states have call successors, (12) Word has length 23
[2025-04-28 21:21:47,693 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:47,694 INFO  L225             Difference]: With dead ends: 23
[2025-04-28 21:21:47,694 INFO  L226             Difference]: Without dead ends: 23
[2025-04-28 21:21:47,694 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:21:47,695 INFO  L437           NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:47,695 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 102 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:47,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2025-04-28 21:21:47,698 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2025-04-28 21:21:47,699 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:47,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions.
[2025-04-28 21:21:47,700 INFO  L79                 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 23
[2025-04-28 21:21:47,700 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:47,700 INFO  L485      AbstractCegarLoop]: Abstraction has 23 states and 24 transitions.
[2025-04-28 21:21:47,700 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 11 states have call successors, (12)
[2025-04-28 21:21:47,700 INFO  L278                IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions.
[2025-04-28 21:21:47,703 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-04-28 21:21:47,703 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:47,703 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:47,708 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:47,903 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:47,904 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:47,904 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:47,904 INFO  L85        PathProgramCache]: Analyzing trace with hash -1948473488, now seen corresponding path program 3 times
[2025-04-28 21:21:47,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:47,904 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490901922]
[2025-04-28 21:21:47,904 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:47,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:47,915 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes.
[2025-04-28 21:21:47,937 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:47,937 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:21:47,937 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:47,937 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:47,943 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-04-28 21:21:47,958 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:47,958 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:47,958 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:47,979 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:47,979 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:47,981 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:47,983 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:21:47,987 INFO  L422         BasicCegarLoop]: Path program histogram: [3, 1, 1]
[2025-04-28 21:21:48,007 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:48,012 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:48 BoogieIcfgContainer
[2025-04-28 21:21:48,012 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:48,013 INFO  L158              Benchmark]: Toolchain (without parser) took 9841.68ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 161.3MB in the beginning and 123.3MB in the end (delta: 38.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:48,014 INFO  L158              Benchmark]: SmtParser took 0.52ms. Allocated memory is still 234.9MB. Free memory is still 170.6MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:48,014 INFO  L158              Benchmark]: ChcToBoogie took 45.24ms. Allocated memory is still 234.9MB. Free memory was 161.3MB in the beginning and 160.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:48,015 INFO  L158              Benchmark]: Boogie Preprocessor took 108.94ms. Allocated memory is still 234.9MB. Free memory was 160.0MB in the beginning and 157.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:48,016 INFO  L158              Benchmark]: RCFGBuilder took 346.99ms. Allocated memory is still 234.9MB. Free memory was 157.9MB in the beginning and 147.5MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:48,016 INFO  L158              Benchmark]: TraceAbstraction took 9331.37ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 146.8MB in the beginning and 123.3MB in the end (delta: 23.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:48,017 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.52ms. Allocated memory is still 234.9MB. Free memory is still 170.6MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 45.24ms. Allocated memory is still 234.9MB. Free memory was 161.3MB in the beginning and 160.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 108.94ms. Allocated memory is still 234.9MB. Free memory was 160.0MB in the beginning and 157.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 346.99ms. Allocated memory is still 234.9MB. Free memory was 157.9MB in the beginning and 147.5MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 9331.37ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 146.8MB in the beginning and 123.3MB in the end (delta: 23.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.ATorig.main.exit.split();
[L0]        assume ((((((((((((((((((((!(!hbv_main.ATorig.main.exit.split_C_1 && hbv_main.ATorig.main.exit.split_U_2) && !((hbv_main.ATorig.main.exit.split_O_10 && hbv_main.ATorig.main.exit.split_U_2) && hbv_main.ATorig.main.exit.split_O_14 != hbv_main.ATorig.main.exit.split_L_16)) && !((hbv_main.ATorig.main.exit.split_U_2 && (!hbv_main.ATorig.main.exit.split_P_15 || hbv_main.ATorig.main.exit.split_O_14 != hbv_main.ATorig.main.exit.split_B_7)) && (hbv_main.ATorig.main.exit.split_P_15 || hbv_main.ATorig.main.exit.split_O_14 == hbv_main.ATorig.main.exit.split_B_7))) && !(hbv_main.ATorig.main.exit.split_M_6 <= hbv_main.ATorig.main.exit.split_E_17 && hbv_main.ATorig.main.exit.split_F_18)) && hbv_main.ATorig.main.exit.split_E_17 + 1 == hbv_main.ATorig.main.exit.split_D_21) && !(!hbv_main.ATorig.main.exit.split_F_18 && hbv_main.ATorig.main.exit.split_E_17 < hbv_main.ATorig.main.exit.split_M_6)) && !(((hbv_main.ATorig.main.exit.split_Q_20 || hbv_main.ATorig.main.exit.split_O_14 == 0) && hbv_main.ATorig.main.exit.split_U_2) && (hbv_main.ATorig.main.exit.split_O_14 != 0 || !hbv_main.ATorig.main.exit.split_Q_20))) && !(hbv_main.ATorig.main.exit.split_U_2 && 2 * hbv_main.ATorig.main.exit.split_M_6 != hbv_main.ATorig.main.exit.split_B_7)) && !((hbv_main.ATorig.main.exit.split_O_10 && hbv_main.ATorig.main.exit.split_K_11) && hbv_main.ATorig.main.exit.split_F_18)) && !(hbv_main.ATorig.main.exit.split_O_10 && (!hbv_main.ATorig.main.exit.split_O_10 || !hbv_main.ATorig.main.exit.split_K_11))) && (if hbv_main.ATorig.main.exit.split_B_22 then -10 else hbv_main.ATorig.main.exit.split_C_13) == hbv_main.ATorig.main.exit.split_G_9) && !((!hbv_main.ATorig.main.exit.split_U_2 || !hbv_main.ATorig.main.exit.split_V_4) && hbv_main.ATorig.main.exit.split_V_4)) && !(hbv_main.ATorig.main.exit.split_U_2 && (!hbv_main.ATorig.main.exit.split_O_10 || !hbv_main.ATorig.main.exit.split_U_2))) && 2 + hbv_main.ATorig.main.exit.split_A_12 == hbv_main.ATorig.main.exit.split_C_13) && !(((hbv_main.ATorig.main.exit.split_I_5 && hbv_main.ATorig.main.exit.split_C_1) || (!hbv_main.ATorig.main.exit.split_C_1 && !hbv_main.ATorig.main.exit.split_I_5)) && hbv_main.ATorig.main.exit.split_U_2)) && !((hbv_main.ATorig.main.exit.split_L_16 != hbv_main.ATorig.main.exit.split_J_19 && hbv_main.ATorig.main.exit.split_O_10) && hbv_main.ATorig.main.exit.split_U_2)) && !((hbv_main.ATorig.main.exit.split_J_19 != hbv_main.ATorig.main.exit.split_A_8 && hbv_main.ATorig.main.exit.split_O_10) && hbv_main.ATorig.main.exit.split_K_11)) && !(hbv_main.ATorig.main.exit.split_R_3 && hbv_main.ATorig.main.exit.split_U_2)) && !!hbv_main.ATorig.main.exit.split_V_4) && !((hbv_main.ATorig.main.exit.split_B_22 || hbv_main.ATorig.main.exit.split_E_17 == 4) && (!hbv_main.ATorig.main.exit.split_B_22 || hbv_main.ATorig.main.exit.split_E_17 != 4))) && !((hbv_main.ATorig.main.exit.split_U_2 && ((hbv_main.ATorig.main.exit.split_I_5 || hbv_main.ATorig.main.exit.split_P_15) || hbv_main.ATorig.main.exit.split_Q_20)) && (!hbv_main.ATorig.main.exit.split_I_5 || (!hbv_main.ATorig.main.exit.split_P_15 && !hbv_main.ATorig.main.exit.split_Q_20)))) && !((hbv_main.ATorig.main.exit.split_A_8 != hbv_main.ATorig.main.exit.split_G_9 && hbv_main.ATorig.main.exit.split_O_10) && hbv_main.ATorig.main.exit.split_K_11);
      VAL   [hbv_main.ATorig.main.exit.split_A_12=6, hbv_main.ATorig.main.exit.split_E_17=4, hbv_main.ATorig.main.exit.split_M_6=4]
[L0]  CALL  call main.AT.lr.ph(hbv_main.ATorig.main.exit.split_M_6, hbv_main.ATorig.main.exit.split_A_12, hbv_main.ATorig.main.exit.split_E_17);
      VAL   [hhv_main.AT.lr.ph_I_0=4, hhv_main.AT.lr.ph_J_1=6, hhv_main.AT.lr.ph_K_2=4]
[L0]        assume (((((((((((!((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_I_7) && hbv_main.AT.lr.ph_H_11 != hbv_main.AT.lr.ph_F_10) && !!hbv_main.AT.lr.ph_I_7) && !(hhv_main.AT.lr.ph_I_0 <= hbv_main.AT.lr.ph_B_1 && hbv_main.AT.lr.ph_E_2)) && !((hbv_main.AT.lr.ph_B_1 == 4 || hbv_main.AT.lr.ph_D_8) && (!hbv_main.AT.lr.ph_D_8 || hbv_main.AT.lr.ph_B_1 != 4))) && !((hbv_main.AT.lr.ph_H_5 != hbv_main.AT.lr.ph_G_9 && hbv_main.AT.lr.ph_C_6) && hbv_main.AT.lr.ph_I_7)) && hbv_main.AT.lr.ph_G_9 == hbv_main.AT.lr.ph_B_1 + 1) && 2 + hbv_main.AT.lr.ph_A_3 == hbv_main.AT.lr.ph_C_4) && !(hbv_main.AT.lr.ph_B_1 < hhv_main.AT.lr.ph_I_0 && !hbv_main.AT.lr.ph_E_2)) && !((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_I_7) && hhv_main.AT.lr.ph_J_1 != hbv_main.AT.lr.ph_H_11)) && !(hbv_main.AT.lr.ph_I_7 && (!hbv_main.AT.lr.ph_C_6 || !hbv_main.AT.lr.ph_I_7))) && (if hbv_main.AT.lr.ph_D_8 then -10 else hbv_main.AT.lr.ph_C_4) == hbv_main.AT.lr.ph_F_10) && !((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_I_7) && !hbv_main.AT.lr.ph_E_2)) && !((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_I_7) && hhv_main.AT.lr.ph_K_2 != hbv_main.AT.lr.ph_H_5);
      VAL   [hbv_main.AT.lr.ph_A_3=4, hbv_main.AT.lr.ph_B_1=3, hhv_main.AT.lr.ph_I_0=4, hhv_main.AT.lr.ph_J_1=6, hhv_main.AT.lr.ph_K_2=4]
[L0]  CALL  call main.AT.lr.ph(hhv_main.AT.lr.ph_I_0, hbv_main.AT.lr.ph_A_3, hbv_main.AT.lr.ph_B_1);
      VAL   [hhv_main.AT.lr.ph_I_0=4, hhv_main.AT.lr.ph_J_1=4, hhv_main.AT.lr.ph_K_2=3]
[L0]        assume (((((((((((!((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_I_7) && hbv_main.AT.lr.ph_H_11 != hbv_main.AT.lr.ph_F_10) && !!hbv_main.AT.lr.ph_I_7) && !(hhv_main.AT.lr.ph_I_0 <= hbv_main.AT.lr.ph_B_1 && hbv_main.AT.lr.ph_E_2)) && !((hbv_main.AT.lr.ph_B_1 == 4 || hbv_main.AT.lr.ph_D_8) && (!hbv_main.AT.lr.ph_D_8 || hbv_main.AT.lr.ph_B_1 != 4))) && !((hbv_main.AT.lr.ph_H_5 != hbv_main.AT.lr.ph_G_9 && hbv_main.AT.lr.ph_C_6) && hbv_main.AT.lr.ph_I_7)) && hbv_main.AT.lr.ph_G_9 == hbv_main.AT.lr.ph_B_1 + 1) && 2 + hbv_main.AT.lr.ph_A_3 == hbv_main.AT.lr.ph_C_4) && !(hbv_main.AT.lr.ph_B_1 < hhv_main.AT.lr.ph_I_0 && !hbv_main.AT.lr.ph_E_2)) && !((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_I_7) && hhv_main.AT.lr.ph_J_1 != hbv_main.AT.lr.ph_H_11)) && !(hbv_main.AT.lr.ph_I_7 && (!hbv_main.AT.lr.ph_C_6 || !hbv_main.AT.lr.ph_I_7))) && (if hbv_main.AT.lr.ph_D_8 then -10 else hbv_main.AT.lr.ph_C_4) == hbv_main.AT.lr.ph_F_10) && !((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_I_7) && !hbv_main.AT.lr.ph_E_2)) && !((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_I_7) && hhv_main.AT.lr.ph_K_2 != hbv_main.AT.lr.ph_H_5);
      VAL   [hbv_main.AT.lr.ph_A_3=2, hbv_main.AT.lr.ph_B_1=2, hhv_main.AT.lr.ph_I_0=4, hhv_main.AT.lr.ph_J_1=4, hhv_main.AT.lr.ph_K_2=3]
[L0]  CALL  call main.AT.lr.ph(hhv_main.AT.lr.ph_I_0, hbv_main.AT.lr.ph_A_3, hbv_main.AT.lr.ph_B_1);
      VAL   [hhv_main.AT.lr.ph_I_0=4, hhv_main.AT.lr.ph_J_1=2, hhv_main.AT.lr.ph_K_2=2]
[L0]        assume (((((((((((!((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_I_7) && hbv_main.AT.lr.ph_H_11 != hbv_main.AT.lr.ph_F_10) && !!hbv_main.AT.lr.ph_I_7) && !(hhv_main.AT.lr.ph_I_0 <= hbv_main.AT.lr.ph_B_1 && hbv_main.AT.lr.ph_E_2)) && !((hbv_main.AT.lr.ph_B_1 == 4 || hbv_main.AT.lr.ph_D_8) && (!hbv_main.AT.lr.ph_D_8 || hbv_main.AT.lr.ph_B_1 != 4))) && !((hbv_main.AT.lr.ph_H_5 != hbv_main.AT.lr.ph_G_9 && hbv_main.AT.lr.ph_C_6) && hbv_main.AT.lr.ph_I_7)) && hbv_main.AT.lr.ph_G_9 == hbv_main.AT.lr.ph_B_1 + 1) && 2 + hbv_main.AT.lr.ph_A_3 == hbv_main.AT.lr.ph_C_4) && !(hbv_main.AT.lr.ph_B_1 < hhv_main.AT.lr.ph_I_0 && !hbv_main.AT.lr.ph_E_2)) && !((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_I_7) && hhv_main.AT.lr.ph_J_1 != hbv_main.AT.lr.ph_H_11)) && !(hbv_main.AT.lr.ph_I_7 && (!hbv_main.AT.lr.ph_C_6 || !hbv_main.AT.lr.ph_I_7))) && (if hbv_main.AT.lr.ph_D_8 then -10 else hbv_main.AT.lr.ph_C_4) == hbv_main.AT.lr.ph_F_10) && !((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_I_7) && !hbv_main.AT.lr.ph_E_2)) && !((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_I_7) && hhv_main.AT.lr.ph_K_2 != hbv_main.AT.lr.ph_H_5);
      VAL   [hbv_main.AT.lr.ph_A_3=0, hbv_main.AT.lr.ph_B_1=1, hhv_main.AT.lr.ph_I_0=4, hhv_main.AT.lr.ph_J_1=2, hhv_main.AT.lr.ph_K_2=2]
[L0]  CALL  call main.AT.lr.ph(hhv_main.AT.lr.ph_I_0, hbv_main.AT.lr.ph_A_3, hbv_main.AT.lr.ph_B_1);
      VAL   [hhv_main.AT.lr.ph_I_0=4, hhv_main.AT.lr.ph_J_1=0, hhv_main.AT.lr.ph_K_2=1]
[L0]        assume (((((((((!((hbv_main.AT.lr.ph_C_6 && hbv_main.AT.lr.ph_G_4) && hbv_main.AT.lr.ph_D_8) && !((!hbv_main.AT.lr.ph_F_3 || !hbv_main.AT.lr.ph_G_4) && hbv_main.AT.lr.ph_F_3)) && !(hbv_main.AT.lr.ph_D_8 && 1 <= hhv_main.AT.lr.ph_I_0)) && !!hbv_main.AT.lr.ph_F_3) && !((hbv_main.AT.lr.ph_F_3 && hbv_main.AT.lr.ph_G_4) && hbv_main.AT.lr.ph_E_7 != 0)) && !(hhv_main.AT.lr.ph_I_0 < 1 && !hbv_main.AT.lr.ph_D_8)) && !((hbv_main.AT.lr.ph_F_3 && hbv_main.AT.lr.ph_G_4) && hbv_main.AT.lr.ph_H_5 != 1)) && !((hbv_main.AT.lr.ph_F_3 && hbv_main.AT.lr.ph_G_4) && hhv_main.AT.lr.ph_K_2 != hbv_main.AT.lr.ph_H_5)) && hbv_main.AT.lr.ph_B_1 == hbv_main.AT.lr.ph_A_2) && !((!hbv_main.AT.lr.ph_G_4 || !hbv_main.AT.lr.ph_C_6) && hbv_main.AT.lr.ph_G_4)) && !((hbv_main.AT.lr.ph_F_3 && hbv_main.AT.lr.ph_G_4) && hhv_main.AT.lr.ph_J_1 != hbv_main.AT.lr.ph_E_7);
      VAL   [hbv_main.AT.lr.ph_B_1=9, hhv_main.AT.lr.ph_I_0=4, hhv_main.AT.lr.ph_J_1=0, hhv_main.AT.lr.ph_K_2=1]
[L0]  CALL  call main.ATentry(hbv_main.AT.lr.ph_B_1);
[L0]  RET   call main.ATentry(hbv_main.AT.lr.ph_B_1);
      VAL   [hbv_main.AT.lr.ph_B_1=9, hhv_main.AT.lr.ph_I_0=4, hhv_main.AT.lr.ph_J_1=0, hhv_main.AT.lr.ph_K_2=1]
[L0]  RET   call main.AT.lr.ph(hhv_main.AT.lr.ph_I_0, hbv_main.AT.lr.ph_A_3, hbv_main.AT.lr.ph_B_1);
      VAL   [hbv_main.AT.lr.ph_A_3=0, hbv_main.AT.lr.ph_B_1=1, hhv_main.AT.lr.ph_I_0=4, hhv_main.AT.lr.ph_J_1=2, hhv_main.AT.lr.ph_K_2=2]
[L0]  RET   call main.AT.lr.ph(hhv_main.AT.lr.ph_I_0, hbv_main.AT.lr.ph_A_3, hbv_main.AT.lr.ph_B_1);
      VAL   [hbv_main.AT.lr.ph_A_3=2, hbv_main.AT.lr.ph_B_1=2, hhv_main.AT.lr.ph_I_0=4, hhv_main.AT.lr.ph_J_1=4, hhv_main.AT.lr.ph_K_2=3]
[L0]  RET   call main.AT.lr.ph(hhv_main.AT.lr.ph_I_0, hbv_main.AT.lr.ph_A_3, hbv_main.AT.lr.ph_B_1);
      VAL   [hbv_main.AT.lr.ph_A_3=4, hbv_main.AT.lr.ph_B_1=3, hhv_main.AT.lr.ph_I_0=4, hhv_main.AT.lr.ph_J_1=6, hhv_main.AT.lr.ph_K_2=4]
[L0]  RET   call main.AT.lr.ph(hbv_main.ATorig.main.exit.split_M_6, hbv_main.ATorig.main.exit.split_A_12, hbv_main.ATorig.main.exit.split_E_17);
      VAL   [hbv_main.ATorig.main.exit.split_A_12=6, hbv_main.ATorig.main.exit.split_E_17=4, hbv_main.ATorig.main.exit.split_M_6=4]
[L0]  RET   call main.ATorig.main.exit.split();
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 20 locations, 29 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 70 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=4, 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 827 SizeOfPredicates, 74 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 12/39 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:48,035 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
