./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/hcai-bench/svcomp/O0/O0_verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:27:20,314 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:27:20,350 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5897bb8c-85e6-471e-9dc9-783a38f93a19/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:27:20,353 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:27:20,353 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:27:20,367 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:27:20,368 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:27:20,368 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:27:20,368 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:27:20,368 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:27:20,368 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:27:20,368 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:27:20,368 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:27:20,368 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:27:20,369 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:27:20,369 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:27:20,369 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:27:20,369 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:27:20,369 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:27:20,369 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:27:20,369 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:27:20,369 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:27:20,370 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:27:20,370 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:27:20,370 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:27:20,370 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:27:20,370 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:27:20,578 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:27:20,586 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:27:20,588 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:27:20,589 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:27:20,590 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:27:20,590 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5897bb8c-85e6-471e-9dc9-783a38f93a19/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/hcai-bench/svcomp/O0/O0_verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination_000.smt2
[2025-05-07 17:27:20,591 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:27:20,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:27:20,803 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5897bb8c-85e6-471e-9dc9-783a38f93a19/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/hcai-bench/svcomp/O0/O0_verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination_000.smt2
[2025-05-07 17:27:20,806 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:27:20,807 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:27:20,807 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:27:20,807 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:27:20,807 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:27:20,809 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:27:20" (1/1) ...
[2025-05-07 17:27:20,838 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:20 Unit
[2025-05-07 17:27:20,838 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:27:20,839 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:27:20,839 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:27:20,839 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:27:20,850 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:20" (1/1) ...
[2025-05-07 17:27:20,850 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:20" (1/1) ...
[2025-05-07 17:27:20,868 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:20" (1/1) ...
[2025-05-07 17:27:20,868 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:20" (1/1) ...
[2025-05-07 17:27:20,872 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:20" (1/1) ...
[2025-05-07 17:27:20,873 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:20" (1/1) ...
[2025-05-07 17:27:20,874 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:20" (1/1) ...
[2025-05-07 17:27:20,876 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:20" (1/1) ...
[2025-05-07 17:27:20,877 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:20" (1/1) ...
[2025-05-07 17:27:20,889 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:27:20,889 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:27:20,889 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:27:20,889 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:27:20,890 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:20" (1/1) ...
[2025-05-07 17:27:20,892 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:27:20,902 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:20,911 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:27:20,913 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:27:20,920 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:27:20,921 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:27:20,921 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:27:20,921 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATverifier.error.split given in one single declaration
[2025-05-07 17:27:20,921 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATverifier.error.split
[2025-05-07 17:27:20,921 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATverifier.error.split
[2025-05-07 17:27:20,921 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb6 given in one single declaration
[2025-05-07 17:27:20,921 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb6
[2025-05-07 17:27:20,921 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb6
[2025-05-07 17:27:20,921 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb3 given in one single declaration
[2025-05-07 17:27:20,922 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb3
[2025-05-07 17:27:20,922 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb3
[2025-05-07 17:27:20,922 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb2 given in one single declaration
[2025-05-07 17:27:20,922 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb2
[2025-05-07 17:27:20,922 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb2
[2025-05-07 17:27:20,922 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-05-07 17:27:20,922 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-05-07 17:27:20,922 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-05-07 17:27:20,922 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure __VERIFIER_assert given in one single declaration
[2025-05-07 17:27:20,922 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2025-05-07 17:27:20,923 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2025-05-07 17:27:20,923 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure __VERIFIER_assert.AT_ret given in one single declaration
[2025-05-07 17:27:20,923 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert.AT_ret
[2025-05-07 17:27:20,923 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert.AT_ret
[2025-05-07 17:27:20,923 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure __VERIFIER_assert.AT_call given in one single declaration
[2025-05-07 17:27:20,923 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert.AT_call
[2025-05-07 17:27:20,923 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert.AT_call
[2025-05-07 17:27:20,923 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:27:20,923 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:27:20,923 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:27:20,993 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:27:20,995 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:27:21,170 INFO  L?                        ?]: Removed 179 outVars from TransFormulas that were not future-live.
[2025-05-07 17:27:21,171 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:27:21,180 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:27:21,180 INFO  L312             CfgBuilder]: Removed 3 assume(true) statements.
[2025-05-07 17:27:21,180 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:21 BoogieIcfgContainer
[2025-05-07 17:27:21,181 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:27:21,183 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:27:21,183 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:27:21,185 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:27:21,185 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:27:20" (1/3) ...
[2025-05-07 17:27:21,186 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b032285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:27:21, skipping insertion in model container
[2025-05-07 17:27:21,186 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:20" (2/3) ...
[2025-05-07 17:27:21,186 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b032285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:27:21, skipping insertion in model container
[2025-05-07 17:27:21,186 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:21" (3/3) ...
[2025-05-07 17:27:21,187 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:27:21,208 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:27:21,210 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 10 procedures, 41 locations, 64 edges, 10 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:27:21,238 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:27:21,246 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;@253add88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:27:21,247 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:27:21,249 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 41 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 23 states have internal predecessors, (25), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13)
[2025-05-07 17:27:21,254 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2025-05-07 17:27:21,254 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:21,255 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]
[2025-05-07 17:27:21,255 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:21,258 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:21,259 INFO  L85        PathProgramCache]: Analyzing trace with hash 1028044982, now seen corresponding path program 1 times
[2025-05-07 17:27:21,263 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:21,264 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314263467]
[2025-05-07 17:27:21,264 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:21,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:21,285 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-05-07 17:27:21,325 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-05-07 17:27:21,325 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:21,325 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:21,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:27:21,905 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:21,905 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314263467]
[2025-05-07 17:27:21,906 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314263467] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:21,906 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:21,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:27:21,910 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891843546]
[2025-05-07 17:27:21,910 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:21,913 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:27:21,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:21,930 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:27:21,930 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:27:21,931 INFO  L87              Difference]: Start difference. First operand  has 41 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 23 states have internal predecessors, (25), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand  has 8 states, 5 states have (on average 2.2) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6)
[2025-05-07 17:27:22,067 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:22,068 INFO  L93              Difference]: Finished difference Result 49 states and 65 transitions.
[2025-05-07 17:27:22,069 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:27:22,069 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 2.2) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 23
[2025-05-07 17:27:22,070 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:22,075 INFO  L225             Difference]: With dead ends: 49
[2025-05-07 17:27:22,075 INFO  L226             Difference]: Without dead ends: 49
[2025-05-07 17:27:22,076 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:27:22,078 INFO  L437           NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:22,079 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 268 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:22,089 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2025-05-07 17:27:22,104 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45.
[2025-05-07 17:27:22,105 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 45 states, 19 states have (on average 1.368421052631579) internal successors, (26), 24 states have internal predecessors, (26), 13 states have call successors, (13), 9 states have call predecessors, (13), 12 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19)
[2025-05-07 17:27:22,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions.
[2025-05-07 17:27:22,108 INFO  L79                 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 23
[2025-05-07 17:27:22,109 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:22,109 INFO  L485      AbstractCegarLoop]: Abstraction has 45 states and 58 transitions.
[2025-05-07 17:27:22,109 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 2.2) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6)
[2025-05-07 17:27:22,109 INFO  L278                IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions.
[2025-05-07 17:27:22,110 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-05-07 17:27:22,110 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:22,110 INFO  L218           NwaCegarLoop]: trace histogram [2, 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-05-07 17:27:22,111 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:27:22,111 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:22,111 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:22,111 INFO  L85        PathProgramCache]: Analyzing trace with hash 1266555262, now seen corresponding path program 1 times
[2025-05-07 17:27:22,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:22,111 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80966033]
[2025-05-07 17:27:22,112 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:22,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:22,122 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-05-07 17:27:22,135 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-05-07 17:27:22,135 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:22,135 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:22,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:27:22,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:22,557 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80966033]
[2025-05-07 17:27:22,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80966033] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:27:22,557 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865343162]
[2025-05-07 17:27:22,557 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:22,557 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:22,560 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:22,562 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:27:22,563 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:27:22,624 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-05-07 17:27:22,655 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-05-07 17:27:22,655 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:22,655 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:22,658 INFO  L256         TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 55 conjuncts are in the unsatisfiable core
[2025-05-07 17:27:22,663 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:27:22,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:27:22,952 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:27:25,270 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:27:25,271 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865343162] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:27:25,271 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:27:25,271 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20
[2025-05-07 17:27:25,272 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143644031]
[2025-05-07 17:27:25,272 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:27:25,272 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-05-07 17:27:25,272 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:25,273 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-05-07 17:27:25,273 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380
[2025-05-07 17:27:25,273 INFO  L87              Difference]: Start difference. First operand 45 states and 58 transitions. Second operand  has 20 states, 10 states have (on average 2.5) internal successors, (25), 20 states have internal predecessors, (25), 14 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (16), 9 states have call predecessors, (16), 14 states have call successors, (16)
[2025-05-07 17:27:25,477 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:25,477 INFO  L93              Difference]: Finished difference Result 57 states and 77 transitions.
[2025-05-07 17:27:25,477 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:27:25,477 INFO  L79                 Accepts]: Start accepts. Automaton has  has 20 states, 10 states have (on average 2.5) internal successors, (25), 20 states have internal predecessors, (25), 14 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (16), 9 states have call predecessors, (16), 14 states have call successors, (16) Word has length 27
[2025-05-07 17:27:25,478 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:25,478 INFO  L225             Difference]: With dead ends: 57
[2025-05-07 17:27:25,478 INFO  L226             Difference]: Without dead ends: 57
[2025-05-07 17:27:25,479 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506
[2025-05-07 17:27:25,479 INFO  L437           NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:25,479 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 564 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:25,480 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2025-05-07 17:27:25,484 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47.
[2025-05-07 17:27:25,484 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 47 states, 20 states have (on average 1.35) internal successors, (27), 25 states have internal predecessors, (27), 13 states have call successors, (13), 9 states have call predecessors, (13), 13 states have return successors, (21), 13 states have call predecessors, (21), 13 states have call successors, (21)
[2025-05-07 17:27:25,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions.
[2025-05-07 17:27:25,485 INFO  L79                 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 27
[2025-05-07 17:27:25,485 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:25,485 INFO  L485      AbstractCegarLoop]: Abstraction has 47 states and 61 transitions.
[2025-05-07 17:27:25,485 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 10 states have (on average 2.5) internal successors, (25), 20 states have internal predecessors, (25), 14 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (16), 9 states have call predecessors, (16), 14 states have call successors, (16)
[2025-05-07 17:27:25,485 INFO  L278                IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions.
[2025-05-07 17:27:25,485 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-05-07 17:27:25,486 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:25,486 INFO  L218           NwaCegarLoop]: trace histogram [2, 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-05-07 17:27:25,489 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:27:25,686 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:25,687 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:25,688 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:25,689 INFO  L85        PathProgramCache]: Analyzing trace with hash -24615136, now seen corresponding path program 1 times
[2025-05-07 17:27:25,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:25,689 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347517149]
[2025-05-07 17:27:25,689 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:25,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:25,710 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-05-07 17:27:25,728 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-05-07 17:27:25,728 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:25,728 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:26,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:27:26,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:26,020 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347517149]
[2025-05-07 17:27:26,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347517149] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:27:26,021 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419529081]
[2025-05-07 17:27:26,021 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:26,021 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:26,022 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:26,024 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:27:26,025 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:27:26,097 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-05-07 17:27:26,125 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-05-07 17:27:26,125 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:26,125 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:26,127 INFO  L256         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 40 conjuncts are in the unsatisfiable core
[2025-05-07 17:27:26,129 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:27:26,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:27:26,277 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:27:26,277 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [419529081] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:26,277 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:27:26,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14
[2025-05-07 17:27:26,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374120953]
[2025-05-07 17:27:26,278 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:26,278 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:27:26,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:26,279 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:27:26,279 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:27:26,279 INFO  L87              Difference]: Start difference. First operand 47 states and 61 transitions. Second operand  has 6 states, 4 states have (on average 3.25) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7)
[2025-05-07 17:27:26,341 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:26,341 INFO  L93              Difference]: Finished difference Result 51 states and 66 transitions.
[2025-05-07 17:27:26,341 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:27:26,341 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 3.25) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 27
[2025-05-07 17:27:26,341 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:26,342 INFO  L225             Difference]: With dead ends: 51
[2025-05-07 17:27:26,342 INFO  L226             Difference]: Without dead ends: 51
[2025-05-07 17:27:26,343 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:27:26,343 INFO  L437           NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:26,344 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 214 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:26,344 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2025-05-07 17:27:26,350 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49.
[2025-05-07 17:27:26,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 26 states have internal predecessors, (28), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (22), 14 states have call predecessors, (22), 13 states have call successors, (22)
[2025-05-07 17:27:26,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions.
[2025-05-07 17:27:26,351 INFO  L79                 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 27
[2025-05-07 17:27:26,351 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:26,351 INFO  L485      AbstractCegarLoop]: Abstraction has 49 states and 63 transitions.
[2025-05-07 17:27:26,351 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 3.25) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7)
[2025-05-07 17:27:26,352 INFO  L278                IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions.
[2025-05-07 17:27:26,352 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-05-07 17:27:26,353 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:26,353 INFO  L218           NwaCegarLoop]: trace histogram [2, 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-05-07 17:27:26,357 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:27:26,553 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:26,553 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:26,554 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:26,554 INFO  L85        PathProgramCache]: Analyzing trace with hash -1909590676, now seen corresponding path program 1 times
[2025-05-07 17:27:26,554 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:26,554 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204562884]
[2025-05-07 17:27:26,555 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:26,555 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:26,564 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-05-07 17:27:26,577 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-05-07 17:27:26,577 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:26,578 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:26,906 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:27:26,906 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:26,906 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204562884]
[2025-05-07 17:27:26,906 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204562884] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:26,906 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:26,906 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:27:26,906 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488554416]
[2025-05-07 17:27:26,906 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:26,907 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:27:26,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:26,907 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:27:26,907 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:27:26,908 INFO  L87              Difference]: Start difference. First operand 49 states and 63 transitions. Second operand  has 10 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 10 states have internal predecessors, (13), 6 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7)
[2025-05-07 17:27:27,029 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:27,029 INFO  L93              Difference]: Finished difference Result 57 states and 76 transitions.
[2025-05-07 17:27:27,029 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:27:27,029 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 10 states have internal predecessors, (13), 6 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 27
[2025-05-07 17:27:27,030 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:27,030 INFO  L225             Difference]: With dead ends: 57
[2025-05-07 17:27:27,030 INFO  L226             Difference]: Without dead ends: 57
[2025-05-07 17:27:27,031 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:27:27,031 INFO  L437           NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:27,032 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 316 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:27,032 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2025-05-07 17:27:27,038 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51.
[2025-05-07 17:27:27,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 27 states have internal predecessors, (29), 13 states have call successors, (13), 9 states have call predecessors, (13), 15 states have return successors, (24), 15 states have call predecessors, (24), 13 states have call successors, (24)
[2025-05-07 17:27:27,039 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions.
[2025-05-07 17:27:27,039 INFO  L79                 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 27
[2025-05-07 17:27:27,039 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:27,039 INFO  L485      AbstractCegarLoop]: Abstraction has 51 states and 66 transitions.
[2025-05-07 17:27:27,039 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 10 states have internal predecessors, (13), 6 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7)
[2025-05-07 17:27:27,039 INFO  L278                IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions.
[2025-05-07 17:27:27,040 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-05-07 17:27:27,040 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:27,040 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 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, 1]
[2025-05-07 17:27:27,041 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:27:27,041 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:27,041 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:27,041 INFO  L85        PathProgramCache]: Analyzing trace with hash 1184030516, now seen corresponding path program 1 times
[2025-05-07 17:27:27,041 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:27,041 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136337226]
[2025-05-07 17:27:27,041 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:27,041 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:27,050 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-05-07 17:27:27,058 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-05-07 17:27:27,058 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:27,058 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:27,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-05-07 17:27:27,401 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:27,401 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136337226]
[2025-05-07 17:27:27,401 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136337226] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:27:27,401 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666966143]
[2025-05-07 17:27:27,401 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:27,401 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:27,404 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:27,406 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:27:27,406 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-05-07 17:27:27,474 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-05-07 17:27:27,507 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-05-07 17:27:27,507 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:27,507 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:27,509 INFO  L256         TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-05-07 17:27:27,510 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:27:27,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-05-07 17:27:27,606 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:27:28,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-05-07 17:27:28,579 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666966143] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:27:28,579 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:27:28,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 22
[2025-05-07 17:27:28,580 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636045860]
[2025-05-07 17:27:28,580 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:27:28,580 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-05-07 17:27:28,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:28,581 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-05-07 17:27:28,581 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462
[2025-05-07 17:27:28,581 INFO  L87              Difference]: Start difference. First operand 51 states and 66 transitions. Second operand  has 22 states, 12 states have (on average 2.5) internal successors, (30), 22 states have internal predecessors, (30), 14 states have call successors, (17), 1 states have call predecessors, (17), 12 states have return successors, (17), 11 states have call predecessors, (17), 14 states have call successors, (17)
[2025-05-07 17:27:28,743 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:28,743 INFO  L93              Difference]: Finished difference Result 61 states and 80 transitions.
[2025-05-07 17:27:28,744 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:27:28,744 INFO  L79                 Accepts]: Start accepts. Automaton has  has 22 states, 12 states have (on average 2.5) internal successors, (30), 22 states have internal predecessors, (30), 14 states have call successors, (17), 1 states have call predecessors, (17), 12 states have return successors, (17), 11 states have call predecessors, (17), 14 states have call successors, (17) Word has length 31
[2025-05-07 17:27:28,744 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:28,745 INFO  L225             Difference]: With dead ends: 61
[2025-05-07 17:27:28,745 INFO  L226             Difference]: Without dead ends: 61
[2025-05-07 17:27:28,746 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756
[2025-05-07 17:27:28,746 INFO  L437           NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:28,746 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 414 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:28,747 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2025-05-07 17:27:28,753 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53.
[2025-05-07 17:27:28,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 28 states have internal predecessors, (30), 13 states have call successors, (13), 9 states have call predecessors, (13), 16 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25)
[2025-05-07 17:27:28,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions.
[2025-05-07 17:27:28,755 INFO  L79                 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 31
[2025-05-07 17:27:28,755 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:28,755 INFO  L485      AbstractCegarLoop]: Abstraction has 53 states and 68 transitions.
[2025-05-07 17:27:28,755 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 12 states have (on average 2.5) internal successors, (30), 22 states have internal predecessors, (30), 14 states have call successors, (17), 1 states have call predecessors, (17), 12 states have return successors, (17), 11 states have call predecessors, (17), 14 states have call successors, (17)
[2025-05-07 17:27:28,755 INFO  L278                IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions.
[2025-05-07 17:27:28,756 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-05-07 17:27:28,756 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:28,756 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:28,760 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-05-07 17:27:28,957 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:28,958 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:28,958 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:28,959 INFO  L85        PathProgramCache]: Analyzing trace with hash -407844922, now seen corresponding path program 2 times
[2025-05-07 17:27:28,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:28,959 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703794141]
[2025-05-07 17:27:28,959 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:27:28,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:28,991 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes.
[2025-05-07 17:27:29,009 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements.
[2025-05-07 17:27:29,009 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:27:29,009 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-05-07 17:27:29,009 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-05-07 17:27:29,012 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-05-07 17:27:29,020 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-05-07 17:27:29,020 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:29,020 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-05-07 17:27:29,032 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-05-07 17:27:29,032 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-05-07 17:27:29,033 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:27:29,034 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:27:29,036 INFO  L422         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1]
[2025-05-07 17:27:29,044 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:27:29,046 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:27:29 BoogieIcfgContainer
[2025-05-07 17:27:29,046 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:27:29,047 INFO  L158              Benchmark]: Toolchain (without parser) took 8240.52ms. Allocated memory is still 234.9MB. Free memory was 150.7MB in the beginning and 86.2MB in the end (delta: 64.5MB). Peak memory consumption was 75.1MB. Max. memory is 33.6GB.
[2025-05-07 17:27:29,047 INFO  L158              Benchmark]: SmtParser took 0.24ms. Allocated memory is still 234.9MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:29,047 INFO  L158              Benchmark]: ChcToBoogie took 31.45ms. Allocated memory is still 234.9MB. Free memory was 150.5MB in the beginning and 147.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:29,048 INFO  L158              Benchmark]: Boogie Preprocessor took 50.07ms. Allocated memory is still 234.9MB. Free memory was 147.6MB in the beginning and 144.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:29,048 INFO  L158              Benchmark]: RCFGBuilder took 291.23ms. Allocated memory is still 234.9MB. Free memory was 144.8MB in the beginning and 121.1MB in the end (delta: 23.6MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:27:29,048 INFO  L158              Benchmark]: TraceAbstraction took 7864.00ms. Allocated memory is still 234.9MB. Free memory was 120.6MB in the beginning and 86.2MB in the end (delta: 34.4MB). Peak memory consumption was 58.4MB. Max. memory is 33.6GB.
[2025-05-07 17:27:29,049 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.24ms. Allocated memory is still 234.9MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 31.45ms. Allocated memory is still 234.9MB. Free memory was 150.5MB in the beginning and 147.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 50.07ms. Allocated memory is still 234.9MB. Free memory was 147.6MB in the beginning and 144.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 291.23ms. Allocated memory is still 234.9MB. Free memory was 144.8MB in the beginning and 121.1MB in the end (delta: 23.6MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 7864.00ms. Allocated memory is still 234.9MB. Free memory was 120.6MB in the beginning and 86.2MB in the end (delta: 34.4MB). Peak memory consumption was 58.4MB. 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_Z_1 && hbv_main.ATverifier.error.split_X_2) && !hbv_main.ATverifier.error.split_V_5) && !((!hbv_main.ATverifier.error.split_W1_39 || !hbv_main.ATverifier.error.split_X1_47) && hbv_main.ATverifier.error.split_X1_47)) && !(((!hbv_main.ATverifier.error.split_C1_11 && hbv_main.ATverifier.error.split_K1_9 < hbv_main.ATverifier.error.split_L1_10) || (hbv_main.ATverifier.error.split_C1_11 && hbv_main.ATverifier.error.split_L1_10 <= hbv_main.ATverifier.error.split_K1_9)) && hbv_main.ATverifier.error.split_D1_4)) && !(hbv_main.ATverifier.error.split_X_2 && (!hbv_main.ATverifier.error.split_Z_1 || !hbv_main.ATverifier.error.split_X_2))) && !(hbv_main.ATverifier.error.split_P1_3 && (!hbv_main.ATverifier.error.split_P1_3 || !hbv_main.ATverifier.error.split_D1_4))) && !(!hbv_main.ATverifier.error.split_O_31 && 0 < hbv_main.ATverifier.error.split_W_20)) && !(hbv_main.ATverifier.error.split_M1_45 + 1 != hbv_main.ATverifier.error.split_N1_41 && hbv_main.ATverifier.error.split_P1_3)) && !(hbv_main.ATverifier.error.split_E_15 != hbv_main.ATverifier.error.split_P_13[hbv_main.ATverifier.error.split_D_14] && hbv_main.ATverifier.error.split_F_16)) && !((if hbv_main.ATverifier.error.split_O1_17 then 1 else 0) != hbv_main.ATverifier.error.split_S1_18 && hbv_main.ATverifier.error.split_P1_3)) && !(hbv_main.ATverifier.error.split_R1_19 && (!hbv_main.ATverifier.error.split_R1_19 || !hbv_main.ATverifier.error.split_P1_3))) && !(hbv_main.ATverifier.error.split_J1_33 + 1 != hbv_main.ATverifier.error.split_I1_34 && hbv_main.ATverifier.error.split_P1_3)) && !((!hbv_main.ATverifier.error.split_O_31 && hbv_main.ATverifier.error.split_M_32) && hbv_main.ATverifier.error.split_F_16)) && !((hbv_main.ATverifier.error.split_Q_37 <= 0 && hbv_main.ATverifier.error.split_X_2) && 0 < hbv_main.ATverifier.error.split_G1_8)) && !(hbv_main.ATverifier.error.split_D_14 != hbv_main.ATverifier.error.split_G1_8 + hbv_main.ATverifier.error.split_W_20 && hbv_main.ATverifier.error.split_F_16)) && !(hbv_main.ATverifier.error.split_X_2 && hbv_main.ATverifier.error.split_T_27 != (if hbv_main.ATverifier.error.split_S_6 then -1 else 0))) && !((hbv_main.ATverifier.error.split_K1_9 != hbv_main.ATverifier.error.split_B1_46 && hbv_main.ATverifier.error.split_A1_36) && hbv_main.ATverifier.error.split_Z_1)) && !(hbv_main.ATverifier.error.split_J_22 && hbv_main.ATverifier.error.split_H_21 != hbv_main.ATverifier.error.split_G1_8 + hbv_main.ATverifier.error.split_W_20)) && !((hbv_main.ATverifier.error.split_D_14 <= 0 && hbv_main.ATverifier.error.split_F_16) && 0 < hbv_main.ATverifier.error.split_G1_8)) && !((hbv_main.ATverifier.error.split_P1_3 && 0 < hbv_main.ATverifier.error.split_G1_8) && hbv_main.ATverifier.error.split_H1_44 <= 0)) && !(hbv_main.ATverifier.error.split_P1_3 && hbv_main.ATverifier.error.split_K1_9 != hbv_main.ATverifier.error.split_L1_10 + hbv_main.ATverifier.error.split_J1_33)) && !(hbv_main.ATverifier.error.split_P_13[hbv_main.ATverifier.error.split_H_21] != hbv_main.ATverifier.error.split_I_28 && hbv_main.ATverifier.error.split_J_22)) && !(((!hbv_main.ATverifier.error.split_Z_1 || !hbv_main.ATverifier.error.split_A1_36) && hbv_main.ATverifier.error.split_D1_4) && (!hbv_main.ATverifier.error.split_X_2 || !hbv_main.ATverifier.error.split_D1_4))) && !(hbv_main.ATverifier.error.split_F_16 && (!hbv_main.ATverifier.error.split_F_16 || !hbv_main.ATverifier.error.split_M_32))) && !((!hbv_main.ATverifier.error.split_U1_24 || !hbv_main.ATverifier.error.split_R1_19) && hbv_main.ATverifier.error.split_U1_24)) && !!hbv_main.ATverifier.error.split_X1_47) && !((hbv_main.ATverifier.error.split_U1_24 && (hbv_main.ATverifier.error.split_S1_18 == 0 || hbv_main.ATverifier.error.split_T1_23)) && (!hbv_main.ATverifier.error.split_T1_23 || hbv_main.ATverifier.error.split_S1_18 != 0))) && !(hbv_main.ATverifier.error.split_X_2 && hbv_main.ATverifier.error.split_R_7 != hbv_main.ATverifier.error.split_P_13[hbv_main.ATverifier.error.split_Q_37])) && !((hbv_main.ATverifier.error.split_N_30 && hbv_main.ATverifier.error.split_O_31) && hbv_main.ATverifier.error.split_M_32)) && !(!hbv_main.ATverifier.error.split_M_32 && hbv_main.ATverifier.error.split_N_30)) && !(((hbv_main.ATverifier.error.split_G_26 || 32 == hbv_main.ATverifier.error.split_E_15) && hbv_main.ATverifier.error.split_F_16) && (!hbv_main.ATverifier.error.split_G_26 || 32 != hbv_main.ATverifier.error.split_E_15))) && !(!hbv_main.ATverifier.error.split_J_22 && hbv_main.ATverifier.error.split_K_29)) && !(hbv_main.ATverifier.error.split_G1_8 <= 0 && hbv_main.ATverifier.error.split_J_22)) && !(((!hbv_main.ATverifier.error.split_L_38 || 9 != hbv_main.ATverifier.error.split_I_28) && hbv_main.ATverifier.error.split_J_22) && (hbv_main.ATverifier.error.split_L_38 || 9 == hbv_main.ATverifier.error.split_I_28))) && !(hbv_main.ATverifier.error.split_P1_3 && hbv_main.ATverifier.error.split_K1_9 != hbv_main.ATverifier.error.split_M1_45 + hbv_main.ATverifier.error.split_L1_10)) && !((hbv_main.ATverifier.error.split_J_22 && hbv_main.ATverifier.error.split_K_29) && hbv_main.ATverifier.error.split_L_38)) && !((hbv_main.ATverifier.error.split_Q1_35 && hbv_main.ATverifier.error.split_R1_19) && hbv_main.ATverifier.error.split_P1_3)) && !(hbv_main.ATverifier.error.split_G1_8 <= 0 && hbv_main.ATverifier.error.split_F_16)) && !(!hbv_main.ATverifier.error.split_T1_23 && hbv_main.ATverifier.error.split_U1_24)) && !(((hbv_main.ATverifier.error.split_V_5 && hbv_main.ATverifier.error.split_W_20 <= 0) || (0 < hbv_main.ATverifier.error.split_W_20 && !hbv_main.ATverifier.error.split_V_5)) && hbv_main.ATverifier.error.split_Z_1)) && !((hbv_main.ATverifier.error.split_K1_9 != hbv_main.ATverifier.error.split_Y_12 && hbv_main.ATverifier.error.split_D1_4) && hbv_main.ATverifier.error.split_X_2)) && !(hbv_main.ATverifier.error.split_L1_10 + hbv_main.ATverifier.error.split_G1_8 != hbv_main.ATverifier.error.split_H1_44 && hbv_main.ATverifier.error.split_P1_3)) && !(hbv_main.ATverifier.error.split_C1_11 && hbv_main.ATverifier.error.split_D1_4)) && !((hbv_main.ATverifier.error.split_F1_42 <= 0 && hbv_main.ATverifier.error.split_P1_3) && 0 < hbv_main.ATverifier.error.split_E1_43)) && !(hbv_main.ATverifier.error.split_O_31 && hbv_main.ATverifier.error.split_W_20 <= 0)) && !((hbv_main.ATverifier.error.split_H_21 <= 0 && hbv_main.ATverifier.error.split_J_22) && 0 < hbv_main.ATverifier.error.split_G1_8)) && !(hbv_main.ATverifier.error.split_V1_40 && (!hbv_main.ATverifier.error.split_U1_24 || !hbv_main.ATverifier.error.split_V1_40))) && !(((!hbv_main.ATverifier.error.split_J_22 || !hbv_main.ATverifier.error.split_K_29) && hbv_main.ATverifier.error.split_Z_1) && (!hbv_main.ATverifier.error.split_M_32 || !hbv_main.ATverifier.error.split_N_30))) && !((!hbv_main.ATverifier.error.split_J_22 || !hbv_main.ATverifier.error.split_F_16) && hbv_main.ATverifier.error.split_J_22)) && !(hbv_main.ATverifier.error.split_P1_3 && hbv_main.ATverifier.error.split_E1_43 != hbv_main.ATverifier.error.split_F1_42)) && !(hbv_main.ATverifier.error.split_A1_36 && !hbv_main.ATverifier.error.split_Z_1)) && !((hbv_main.ATverifier.error.split_D1_4 && hbv_main.ATverifier.error.split_X_2) && hbv_main.ATverifier.error.split_Y_12 != hbv_main.ATverifier.error.split_U_25)) && !((hbv_main.ATverifier.error.split_A1_36 && hbv_main.ATverifier.error.split_Z_1) && hbv_main.ATverifier.error.split_V_5)) && !((hbv_main.ATverifier.error.split_A1_36 && hbv_main.ATverifier.error.split_Z_1) && hbv_main.ATverifier.error.split_B1_46 != hbv_main.ATverifier.error.split_W_20)) && !((hbv_main.ATverifier.error.split_J_22 && hbv_main.ATverifier.error.split_F_16) && hbv_main.ATverifier.error.split_G_26)) && !(hbv_main.ATverifier.error.split_G1_8 <= 0 && hbv_main.ATverifier.error.split_X_2)) && !(hbv_main.ATverifier.error.split_Q_37 != hbv_main.ATverifier.error.split_G1_8 + hbv_main.ATverifier.error.split_W_20 && hbv_main.ATverifier.error.split_X_2)) && !((!hbv_main.ATverifier.error.split_W1_39 || !hbv_main.ATverifier.error.split_V1_40) && hbv_main.ATverifier.error.split_W1_39)) && !(((!hbv_main.ATverifier.error.split_O1_17 && hbv_main.ATverifier.error.split_N1_41 < 2) || (2 <= hbv_main.ATverifier.error.split_N1_41 && hbv_main.ATverifier.error.split_O1_17)) && hbv_main.ATverifier.error.split_P1_3)) && !(((hbv_main.ATverifier.error.split_S_6 || hbv_main.ATverifier.error.split_R_7 == 34) && (!hbv_main.ATverifier.error.split_S_6 || hbv_main.ATverifier.error.split_R_7 != 34)) && hbv_main.ATverifier.error.split_X_2)) && !(hbv_main.ATverifier.error.split_X_2 && hbv_main.ATverifier.error.split_W_20 + hbv_main.ATverifier.error.split_T_27 != hbv_main.ATverifier.error.split_U_25);
      VAL   [hbv_main.ATverifier.error.split_E1_43=4, hbv_main.ATverifier.error.split_G1_8=1, hbv_main.ATverifier.error.split_L1_10=0, hbv_main.ATverifier.error.split_W_20=1]
[L0]  CALL  call main.AT_bb6(hbv_main.ATverifier.error.split_W_20, hbv_main.ATverifier.error.split_G1_8, hbv_main.ATverifier.error.split_A_48, hbv_main.ATverifier.error.split_P_13, hbv_main.ATverifier.error.split_B_49, hbv_main.ATverifier.error.split_C_50, hbv_main.ATverifier.error.split_L1_10, hbv_main.ATverifier.error.split_E1_43);
      VAL   [hhv_main.AT_bb6_Q_0=1, hhv_main.AT_bb6_R_1=1, hhv_main.AT_bb6_S_2=2, hhv_main.AT_bb6_V_5=1, hhv_main.AT_bb6_W_6=0, hhv_main.AT_bb6_X_7=4]
[L0]        assume (((((((((((((((((((((((!(hbv_main.AT_bb6_M_16 + hbv_main.AT_bb6_L_6 != hhv_main.AT_bb6_W_6 && hbv_main.AT_bb6_O_5) && !((hbv_main.AT_bb6_H_8 && hbv_main.AT_bb6_O_5) && hbv_main.AT_bb6_G_1)) && !((!hbv_main.AT_bb6_O_5 || !hbv_main.AT_bb6_N_11) && hbv_main.AT_bb6_N_11)) && !(hbv_main.AT_bb6_O_5 && hbv_main.AT_bb6_L_6 + hhv_main.AT_bb6_R_1 != hbv_main.AT_bb6_I_7)) && !((!hbv_main.AT_bb6_D_14 || 32 != hbv_main.AT_bb6_B_15) && (hbv_main.AT_bb6_D_14 || 32 == hbv_main.AT_bb6_B_15))) && !!hbv_main.AT_bb6_N_11) && hhv_main.AT_bb6_T_3[hbv_main.AT_bb6_A_9] == hbv_main.AT_bb6_B_15) && !((hbv_main.AT_bb6_C_13 && hbv_main.AT_bb6_G_1) && hbv_main.AT_bb6_D_14)) && !((!hbv_main.AT_bb6_G_1 || !hbv_main.AT_bb6_C_13) && hbv_main.AT_bb6_G_1)) && !(hhv_main.AT_bb6_T_3[hbv_main.AT_bb6_I_7] != hbv_main.AT_bb6_J_4 && hbv_main.AT_bb6_O_5)) && !(hbv_main.AT_bb6_O_5 && (!hbv_main.AT_bb6_O_5 || !hbv_main.AT_bb6_G_1))) && hbv_main.AT_bb6_L_6 + hhv_main.AT_bb6_R_1 == hbv_main.AT_bb6_A_9) && !(((hbv_main.AT_bb6_K_3 || hbv_main.AT_bb6_J_4 == 34) && (hbv_main.AT_bb6_J_4 != 34 || !hbv_main.AT_bb6_K_3)) && hbv_main.AT_bb6_O_5)) && !((hbv_main.AT_bb6_O_5 && hbv_main.AT_bb6_I_7 <= 0) && 0 < hhv_main.AT_bb6_R_1)) && !(hbv_main.AT_bb6_O_5 && (if hbv_main.AT_bb6_K_3 then 1 else 0) != hbv_main.AT_bb6_M_16)) && !(((!hbv_main.AT_bb6_H_8 || 9 != hbv_main.AT_bb6_F_12) && hbv_main.AT_bb6_G_1) && (9 == hbv_main.AT_bb6_F_12 || hbv_main.AT_bb6_H_8))) && !(hbv_main.AT_bb6_F_12 != hhv_main.AT_bb6_T_3[hbv_main.AT_bb6_E_2] && hbv_main.AT_bb6_G_1)) && !(hbv_main.AT_bb6_O_5 && hhv_main.AT_bb6_R_1 <= 0)) && !((hhv_main.AT_bb6_V_5 != hbv_main.AT_bb6_P_10 && hbv_main.AT_bb6_N_11) && hbv_main.AT_bb6_O_5)) && !(hbv_main.AT_bb6_G_1 && hhv_main.AT_bb6_R_1 <= 0)) && !(hbv_main.AT_bb6_L_6 + hhv_main.AT_bb6_R_1 != hbv_main.AT_bb6_E_2 && hbv_main.AT_bb6_G_1)) && !(hbv_main.AT_bb6_A_9 <= 0 && 0 < hhv_main.AT_bb6_R_1)) && !(hhv_main.AT_bb6_R_1 <= 0)) && !((hhv_main.AT_bb6_Q_0 != hbv_main.AT_bb6_P_10 && hbv_main.AT_bb6_N_11) && hbv_main.AT_bb6_O_5)) && !((hbv_main.AT_bb6_G_1 && 0 < hhv_main.AT_bb6_R_1) && hbv_main.AT_bb6_E_2 <= 0);
      VAL   [hbv_main.AT_bb6_L_6=0, hhv_main.AT_bb6_Q_0=1, hhv_main.AT_bb6_R_1=1, hhv_main.AT_bb6_S_2=2, hhv_main.AT_bb6_V_5=1, hhv_main.AT_bb6_W_6=0, hhv_main.AT_bb6_X_7=4]
[L0]  CALL  call main.AT_bb3(hbv_main.AT_bb6_L_6, hhv_main.AT_bb6_R_1, hhv_main.AT_bb6_S_2, hhv_main.AT_bb6_T_3, hhv_main.AT_bb6_U_4, hhv_main.AT_bb6_V_5, hhv_main.AT_bb6_X_7);
      VAL   [hhv_main.AT_bb3_H_0=0, hhv_main.AT_bb3_I_1=1, hhv_main.AT_bb3_J_2=2, hhv_main.AT_bb3_M_5=1, hhv_main.AT_bb3_N_6=4]
[L0]        assume (((((((((hhv_main.AT_bb3_J_2 + hhv_main.AT_bb3_I_1 == hbv_main.AT_bb3_A_6 && !((hbv_main.AT_bb3_B_7 != 0 || !hbv_main.AT_bb3_C_5) && (hbv_main.AT_bb3_C_5 || hbv_main.AT_bb3_B_7 == 0))) && !(hhv_main.AT_bb3_I_1 <= 0)) && !(hbv_main.AT_bb3_E_4 && (!hbv_main.AT_bb3_F_3 || !hbv_main.AT_bb3_E_4))) && !((hbv_main.AT_bb3_F_3 && hbv_main.AT_bb3_E_4) && hhv_main.AT_bb3_H_0 != hbv_main.AT_bb3_G_1)) && hhv_main.AT_bb3_K_3[hbv_main.AT_bb3_A_6] == hbv_main.AT_bb3_B_7) && !((hbv_main.AT_bb3_F_3 && hbv_main.AT_bb3_E_4) && !hbv_main.AT_bb3_C_5)) && hhv_main.AT_bb3_M_5 + 1 == hhv_main.AT_bb3_J_2) && !!hbv_main.AT_bb3_E_4) && !((hbv_main.AT_bb3_F_3 && hbv_main.AT_bb3_E_4) && hbv_main.AT_bb3_G_1 != hbv_main.AT_bb3_D_2)) && !(0 < hhv_main.AT_bb3_I_1 && hbv_main.AT_bb3_A_6 <= 0);
      VAL   [hbv_main.AT_bb3_D_2=0, hhv_main.AT_bb3_H_0=0, hhv_main.AT_bb3_I_1=1, hhv_main.AT_bb3_J_2=2, hhv_main.AT_bb3_M_5=1, hhv_main.AT_bb3_N_6=4]
[L0]  CALL  call main.AT_bb2(hhv_main.AT_bb3_I_1, hhv_main.AT_bb3_K_3, hhv_main.AT_bb3_L_4, hhv_main.AT_bb3_M_5, hbv_main.AT_bb3_D_2, hhv_main.AT_bb3_N_6);
      VAL   [hhv_main.AT_bb2_N_0=1, hhv_main.AT_bb2_Q_3=1, hhv_main.AT_bb2_R_4=0, hhv_main.AT_bb2_S_5=4]
[L0]        assume ((((((((((((((((((((((((!((hbv_main.AT_bb2_R_9 && hbv_main.AT_bb2_S_4) && hbv_main.AT_bb2_O_1 != hbv_main.AT_bb2_T_8) && !!hbv_main.AT_bb2_R_9) && !((hbv_main.AT_bb2_H_3 && hbv_main.AT_bb2_S_4) && hbv_main.AT_bb2_I_2 != hbv_main.AT_bb2_F_17)) && !(hbv_main.AT_bb2_B_5 <= 0 && 0 < hhv_main.AT_bb2_N_0)) && !(hhv_main.AT_bb2_N_0 <= 0)) && hbv_main.AT_bb2_C_15 == hhv_main.AT_bb2_O_1[hbv_main.AT_bb2_B_5]) && !((hbv_main.AT_bb2_R_9 && hbv_main.AT_bb2_S_4) && hbv_main.AT_bb2_N_13 != hbv_main.AT_bb2_Q_12)) && !(hbv_main.AT_bb2_L_19 && hbv_main.AT_bb2_S_4)) && !((hbv_main.AT_bb2_M_6 != hbv_main.AT_bb2_I_7 && hbv_main.AT_bb2_H_3) && hbv_main.AT_bb2_S_4)) && !(hhv_main.AT_bb2_N_0 <= 0 && hbv_main.AT_bb2_S_4)) && hbv_main.AT_bb2_N_13 == hbv_main.AT_bb2_A_18 + 1) && !((hbv_main.AT_bb2_R_9 && hbv_main.AT_bb2_S_4) && hbv_main.AT_bb2_P_16 != hhv_main.AT_bb2_P_2)) && !(((!hbv_main.AT_bb2_L_19 || hbv_main.AT_bb2_K_20 != 0) && hbv_main.AT_bb2_S_4) && (hbv_main.AT_bb2_L_19 || hbv_main.AT_bb2_K_20 == 0))) && !((!hbv_main.AT_bb2_S_4 || !hbv_main.AT_bb2_H_3) && hbv_main.AT_bb2_S_4)) && !(hbv_main.AT_bb2_S_4 && hhv_main.AT_bb2_O_1[hbv_main.AT_bb2_J_14] != hbv_main.AT_bb2_K_20)) && !((hbv_main.AT_bb2_A_11 != hbv_main.AT_bb2_I_7 && hbv_main.AT_bb2_H_3) && hbv_main.AT_bb2_S_4)) && !(hbv_main.AT_bb2_N_13 + hhv_main.AT_bb2_N_0 != hbv_main.AT_bb2_J_14 && hbv_main.AT_bb2_S_4)) && !((hhv_main.AT_bb2_Q_3 != hbv_main.AT_bb2_Q_12 && hbv_main.AT_bb2_R_9) && hbv_main.AT_bb2_S_4)) && hbv_main.AT_bb2_N_13 + hhv_main.AT_bb2_N_0 == hbv_main.AT_bb2_B_5) && !((hbv_main.AT_bb2_R_9 && hbv_main.AT_bb2_S_4) && hbv_main.AT_bb2_P_16 != hbv_main.AT_bb2_M_6)) && !((hbv_main.AT_bb2_C_15 == 0 || hbv_main.AT_bb2_D_10) && (!hbv_main.AT_bb2_D_10 || hbv_main.AT_bb2_C_15 != 0))) && !((hbv_main.AT_bb2_S_4 && 0 < hhv_main.AT_bb2_N_0) && hbv_main.AT_bb2_J_14 <= 0)) && !((hbv_main.AT_bb2_H_3 && hbv_main.AT_bb2_S_4) && hbv_main.AT_bb2_O_1 != hbv_main.AT_bb2_I_2)) && !((hbv_main.AT_bb2_H_3 && hbv_main.AT_bb2_D_10) && hbv_main.AT_bb2_S_4)) && !((hbv_main.AT_bb2_R_9 && hbv_main.AT_bb2_S_4) && hhv_main.AT_bb2_R_4 != hbv_main.AT_bb2_T_8)) && !(hbv_main.AT_bb2_R_9 && (!hbv_main.AT_bb2_S_4 || !hbv_main.AT_bb2_R_9));
      VAL   [hbv_main.AT_bb2_A_18=0, hbv_main.AT_bb2_F_17=0, hhv_main.AT_bb2_N_0=1, hhv_main.AT_bb2_Q_3=1, hhv_main.AT_bb2_R_4=0, hhv_main.AT_bb2_S_5=4]
[L0]  CALL  call main.AT_bb2(hhv_main.AT_bb2_N_0, hhv_main.AT_bb2_O_1, hbv_main.AT_bb2_A_11, hbv_main.AT_bb2_A_18, hbv_main.AT_bb2_F_17, hhv_main.AT_bb2_S_5);
      VAL   [hhv_main.AT_bb2_N_0=1, hhv_main.AT_bb2_Q_3=0, hhv_main.AT_bb2_R_4=0, hhv_main.AT_bb2_S_5=4]
[L0]        assume ((((((((((((((((((((((((!((hbv_main.AT_bb2_R_9 && hbv_main.AT_bb2_S_4) && hbv_main.AT_bb2_O_1 != hbv_main.AT_bb2_T_8) && !!hbv_main.AT_bb2_R_9) && !((hbv_main.AT_bb2_H_3 && hbv_main.AT_bb2_S_4) && hbv_main.AT_bb2_I_2 != hbv_main.AT_bb2_F_17)) && !(hbv_main.AT_bb2_B_5 <= 0 && 0 < hhv_main.AT_bb2_N_0)) && !(hhv_main.AT_bb2_N_0 <= 0)) && hbv_main.AT_bb2_C_15 == hhv_main.AT_bb2_O_1[hbv_main.AT_bb2_B_5]) && !((hbv_main.AT_bb2_R_9 && hbv_main.AT_bb2_S_4) && hbv_main.AT_bb2_N_13 != hbv_main.AT_bb2_Q_12)) && !(hbv_main.AT_bb2_L_19 && hbv_main.AT_bb2_S_4)) && !((hbv_main.AT_bb2_M_6 != hbv_main.AT_bb2_I_7 && hbv_main.AT_bb2_H_3) && hbv_main.AT_bb2_S_4)) && !(hhv_main.AT_bb2_N_0 <= 0 && hbv_main.AT_bb2_S_4)) && hbv_main.AT_bb2_N_13 == hbv_main.AT_bb2_A_18 + 1) && !((hbv_main.AT_bb2_R_9 && hbv_main.AT_bb2_S_4) && hbv_main.AT_bb2_P_16 != hhv_main.AT_bb2_P_2)) && !(((!hbv_main.AT_bb2_L_19 || hbv_main.AT_bb2_K_20 != 0) && hbv_main.AT_bb2_S_4) && (hbv_main.AT_bb2_L_19 || hbv_main.AT_bb2_K_20 == 0))) && !((!hbv_main.AT_bb2_S_4 || !hbv_main.AT_bb2_H_3) && hbv_main.AT_bb2_S_4)) && !(hbv_main.AT_bb2_S_4 && hhv_main.AT_bb2_O_1[hbv_main.AT_bb2_J_14] != hbv_main.AT_bb2_K_20)) && !((hbv_main.AT_bb2_A_11 != hbv_main.AT_bb2_I_7 && hbv_main.AT_bb2_H_3) && hbv_main.AT_bb2_S_4)) && !(hbv_main.AT_bb2_N_13 + hhv_main.AT_bb2_N_0 != hbv_main.AT_bb2_J_14 && hbv_main.AT_bb2_S_4)) && !((hhv_main.AT_bb2_Q_3 != hbv_main.AT_bb2_Q_12 && hbv_main.AT_bb2_R_9) && hbv_main.AT_bb2_S_4)) && hbv_main.AT_bb2_N_13 + hhv_main.AT_bb2_N_0 == hbv_main.AT_bb2_B_5) && !((hbv_main.AT_bb2_R_9 && hbv_main.AT_bb2_S_4) && hbv_main.AT_bb2_P_16 != hbv_main.AT_bb2_M_6)) && !((hbv_main.AT_bb2_C_15 == 0 || hbv_main.AT_bb2_D_10) && (!hbv_main.AT_bb2_D_10 || hbv_main.AT_bb2_C_15 != 0))) && !((hbv_main.AT_bb2_S_4 && 0 < hhv_main.AT_bb2_N_0) && hbv_main.AT_bb2_J_14 <= 0)) && !((hbv_main.AT_bb2_H_3 && hbv_main.AT_bb2_S_4) && hbv_main.AT_bb2_O_1 != hbv_main.AT_bb2_I_2)) && !((hbv_main.AT_bb2_H_3 && hbv_main.AT_bb2_D_10) && hbv_main.AT_bb2_S_4)) && !((hbv_main.AT_bb2_R_9 && hbv_main.AT_bb2_S_4) && hhv_main.AT_bb2_R_4 != hbv_main.AT_bb2_T_8)) && !(hbv_main.AT_bb2_R_9 && (!hbv_main.AT_bb2_S_4 || !hbv_main.AT_bb2_R_9));
      VAL   [hbv_main.AT_bb2_A_18=-1, hbv_main.AT_bb2_F_17=0, hhv_main.AT_bb2_N_0=1, hhv_main.AT_bb2_Q_3=0, hhv_main.AT_bb2_R_4=0, hhv_main.AT_bb2_S_5=4]
[L0]  CALL  call main.AT_bb2(hhv_main.AT_bb2_N_0, hhv_main.AT_bb2_O_1, hbv_main.AT_bb2_A_11, hbv_main.AT_bb2_A_18, hbv_main.AT_bb2_F_17, hhv_main.AT_bb2_S_5);
      VAL   [hhv_main.AT_bb2_N_0=1, hhv_main.AT_bb2_Q_3=-1, hhv_main.AT_bb2_R_4=0, hhv_main.AT_bb2_S_5=4]
[L0]        assume ((((((((((((((((((!(hbv_main.AT_bb2_F_1 && (!hbv_main.AT_bb2_F_1 || !hbv_main.AT_bb2_E_2)) && hhv_main.AT_bb2_O_1 == hbv_main.AT_bb2_A_11[hbv_main.AT_bb2_B_10 := 0]) && !((hbv_main.AT_bb2_K_5 && hbv_main.AT_bb2_L_6) && hbv_main.AT_bb2_M_4 != 0)) && !((hbv_main.AT_bb2_K_5 && hbv_main.AT_bb2_L_6) && hbv_main.AT_bb2_H_13 != hbv_main.AT_bb2_I_7)) && !((hbv_main.AT_bb2_K_5 && hbv_main.AT_bb2_L_6) && hhv_main.AT_bb2_P_2 != hbv_main.AT_bb2_I_7)) && !(hbv_main.AT_bb2_C_3 <= 0)) && !((hbv_main.AT_bb2_K_5 && hbv_main.AT_bb2_L_6) && hbv_main.AT_bb2_J_9 != hhv_main.AT_bb2_Q_3)) && !((hbv_main.AT_bb2_K_5 && hbv_main.AT_bb2_L_6) && hbv_main.AT_bb2_J_9 + 1 != 0)) && !(0 < hbv_main.AT_bb2_C_3 && hhv_main.AT_bb2_N_0 <= 0)) && hbv_main.AT_bb2_C_3 + 8 == hbv_main.AT_bb2_B_10) && !((!hbv_main.AT_bb2_L_6 || !hbv_main.AT_bb2_F_1) && hbv_main.AT_bb2_L_6)) && !(hbv_main.AT_bb2_K_5 && (!hbv_main.AT_bb2_L_6 || !hbv_main.AT_bb2_K_5))) && hhv_main.AT_bb2_N_0 == hbv_main.AT_bb2_C_3) && !((hbv_main.AT_bb2_M_4 != hhv_main.AT_bb2_R_4 && hbv_main.AT_bb2_K_5) && hbv_main.AT_bb2_L_6)) && !hbv_main.AT_bb2_D_8) && !(hhv_main.AT_bb2_S_5 <= 0)) && !((hbv_main.AT_bb2_L_6 && (hhv_main.AT_bb2_N_0 != 0 || !hbv_main.AT_bb2_G_12)) && (hhv_main.AT_bb2_N_0 == 0 || hbv_main.AT_bb2_G_12))) && !!hbv_main.AT_bb2_K_5) && !(hbv_main.AT_bb2_L_6 && hbv_main.AT_bb2_G_12)) && !(hbv_main.AT_bb2_B_10 <= 0 && 0 < hbv_main.AT_bb2_C_3);
      VAL   [hhv_main.AT_bb2_N_0=1, hhv_main.AT_bb2_Q_3=-1, hhv_main.AT_bb2_R_4=0, hhv_main.AT_bb2_S_5=4]
[L0]  CALL  call main.ATentry();
[L0]  RET   call main.ATentry();
      VAL   [hhv_main.AT_bb2_N_0=1, hhv_main.AT_bb2_Q_3=-1, hhv_main.AT_bb2_R_4=0, hhv_main.AT_bb2_S_5=4]
[L0]  RET   call main.AT_bb2(hhv_main.AT_bb2_N_0, hhv_main.AT_bb2_O_1, hbv_main.AT_bb2_A_11, hbv_main.AT_bb2_A_18, hbv_main.AT_bb2_F_17, hhv_main.AT_bb2_S_5);
      VAL   [hbv_main.AT_bb2_A_18=-1, hbv_main.AT_bb2_F_17=0, hhv_main.AT_bb2_N_0=1, hhv_main.AT_bb2_Q_3=0, hhv_main.AT_bb2_R_4=0, hhv_main.AT_bb2_S_5=4]
[L0]  RET   call main.AT_bb2(hhv_main.AT_bb2_N_0, hhv_main.AT_bb2_O_1, hbv_main.AT_bb2_A_11, hbv_main.AT_bb2_A_18, hbv_main.AT_bb2_F_17, hhv_main.AT_bb2_S_5);
      VAL   [hbv_main.AT_bb2_A_18=0, hbv_main.AT_bb2_F_17=0, hhv_main.AT_bb2_N_0=1, hhv_main.AT_bb2_Q_3=1, hhv_main.AT_bb2_R_4=0, hhv_main.AT_bb2_S_5=4]
[L0]  RET   call main.AT_bb2(hhv_main.AT_bb3_I_1, hhv_main.AT_bb3_K_3, hhv_main.AT_bb3_L_4, hhv_main.AT_bb3_M_5, hbv_main.AT_bb3_D_2, hhv_main.AT_bb3_N_6);
      VAL   [hbv_main.AT_bb3_D_2=0, hhv_main.AT_bb3_H_0=0, hhv_main.AT_bb3_I_1=1, hhv_main.AT_bb3_J_2=2, hhv_main.AT_bb3_M_5=1, hhv_main.AT_bb3_N_6=4]
[L0]  RET   call main.AT_bb3(hbv_main.AT_bb6_L_6, hhv_main.AT_bb6_R_1, hhv_main.AT_bb6_S_2, hhv_main.AT_bb6_T_3, hhv_main.AT_bb6_U_4, hhv_main.AT_bb6_V_5, hhv_main.AT_bb6_X_7);
      VAL   [hbv_main.AT_bb6_L_6=0, hhv_main.AT_bb6_Q_0=1, hhv_main.AT_bb6_R_1=1, hhv_main.AT_bb6_S_2=2, hhv_main.AT_bb6_V_5=1, hhv_main.AT_bb6_W_6=0, hhv_main.AT_bb6_X_7=4]
[L0]  RET   call main.AT_bb6(hbv_main.ATverifier.error.split_W_20, hbv_main.ATverifier.error.split_G1_8, hbv_main.ATverifier.error.split_A_48, hbv_main.ATverifier.error.split_P_13, hbv_main.ATverifier.error.split_B_49, hbv_main.ATverifier.error.split_C_50, hbv_main.ATverifier.error.split_L1_10, hbv_main.ATverifier.error.split_E1_43);
      VAL   [hbv_main.ATverifier.error.split_A_48=2, hbv_main.ATverifier.error.split_C_50=1, hbv_main.ATverifier.error.split_E1_43=4, hbv_main.ATverifier.error.split_G1_8=1, hbv_main.ATverifier.error.split_L1_10=0, hbv_main.ATverifier.error.split_W_20=1]
[L0]  RET   call main.ATverifier.error.split();
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 10 procedures, 41 locations, 64 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 1776 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1551 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 624 IncrementalHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 225 mSDtfsCounter, 624 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 122 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=5, InterpolantAutomatonStates: 48, 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, 5 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 1078 SizeOfPredicates, 72 NumberOfNonLiveVariables, 743 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 22/36 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-05-07 17:27:29,058 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
