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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:10,802 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:10,915 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c54d273-2fb1-4cb8-8995-96ff1142ab73/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:10,920 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:10,923 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:10,959 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:10,960 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:10,960 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:10,961 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:10,961 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:10,962 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:10,962 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:10,963 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:10,963 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:10,963 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:10,963 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:10,963 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:10,964 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:10,964 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:10,964 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:10,964 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:10,964 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:10,964 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:10,964 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:10,965 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:10,965 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:10,966 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:11,343 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:11,354 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:11,358 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:11,361 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:11,361 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:11,363 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c54d273-2fb1-4cb8-8995-96ff1142ab73/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-031.smt2
[2025-04-28 21:21:11,365 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:11,370 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:11,779 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c54d273-2fb1-4cb8-8995-96ff1142ab73/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-031.smt2
[2025-04-28 21:21:11,783 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:11,784 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:11,785 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:11,785 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:11,786 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:11,792 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,851 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11 Unit
[2025-04-28 21:21:11,851 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:11,852 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:11,853 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:11,853 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:11,871 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,871 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,911 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,915 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,928 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,929 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,934 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,936 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,940 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,966 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:11,966 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:11,967 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:11,967 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:11,968 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (1/1) ...
[2025-04-28 21:21:11,971 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:11,990 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:12,006 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:12,011 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:12,028 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:12,028 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:12,028 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:12,029 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATverifier.error.split given in one single declaration
[2025-04-28 21:21:12,029 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATverifier.error.split
[2025-04-28 21:21:12,029 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATverifier.error.split
[2025-04-28 21:21:12,029 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb10 given in one single declaration
[2025-04-28 21:21:12,029 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb10
[2025-04-28 21:21:12,029 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb10
[2025-04-28 21:21:12,029 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb6 given in one single declaration
[2025-04-28 21:21:12,029 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb6
[2025-04-28 21:21:12,030 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb6
[2025-04-28 21:21:12,030 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb7 given in one single declaration
[2025-04-28 21:21:12,030 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb7
[2025-04-28 21:21:12,032 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb7
[2025-04-28 21:21:12,032 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb4 given in one single declaration
[2025-04-28 21:21:12,032 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb4
[2025-04-28 21:21:12,033 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb4
[2025-04-28 21:21:12,033 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb given in one single declaration
[2025-04-28 21:21:12,033 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb
[2025-04-28 21:21:12,033 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb
[2025-04-28 21:21:12,033 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-04-28 21:21:12,033 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-04-28 21:21:12,033 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-04-28 21:21:12,033 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb11 given in one single declaration
[2025-04-28 21:21:12,033 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb11
[2025-04-28 21:21:12,033 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb11
[2025-04-28 21:21:12,033 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:12,033 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:12,034 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:12,171 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:12,173 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:12,566 INFO  L?                        ?]: Removed 114 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:12,566 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:12,581 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:12,585 INFO  L312             CfgBuilder]: Removed 2 assume(true) statements.
[2025-04-28 21:21:12,586 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:12 BoogieIcfgContainer
[2025-04-28 21:21:12,586 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:12,590 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:12,593 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:12,599 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:12,599 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:11" (1/3) ...
[2025-04-28 21:21:12,600 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f297ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:12, skipping insertion in model container
[2025-04-28 21:21:12,600 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:11" (2/3) ...
[2025-04-28 21:21:12,601 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f297ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:12, skipping insertion in model container
[2025-04-28 21:21:12,601 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:12" (3/3) ...
[2025-04-28 21:21:12,603 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:12,621 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:12,624 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 10 procedures, 44 locations, 70 edges, 10 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:12,686 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:12,707 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;@64569d93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:12,708 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:12,715 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 44 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 25 states have internal predecessors, (25), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 9 states have call predecessors, (15), 15 states have call successors, (15)
[2025-04-28 21:21:12,727 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-04-28 21:21:12,728 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:12,729 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:12,729 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:12,735 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:12,737 INFO  L85        PathProgramCache]: Analyzing trace with hash -891349732, now seen corresponding path program 1 times
[2025-04-28 21:21:12,745 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:12,745 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790338129]
[2025-04-28 21:21:12,746 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:12,746 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:12,788 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-04-28 21:21:12,836 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:12,836 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:12,837 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:13,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:13,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:13,512 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790338129]
[2025-04-28 21:21:13,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790338129] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:13,513 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:13,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:13,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704656978]
[2025-04-28 21:21:13,519 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:13,526 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:13,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:13,558 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:13,559 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:13,561 INFO  L87              Difference]: Start difference. First operand  has 44 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 25 states have internal predecessors, (25), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 9 states have call predecessors, (15), 15 states have call successors, (15) 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), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:13,783 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:13,784 INFO  L93              Difference]: Finished difference Result 48 states and 61 transitions.
[2025-04-28 21:21:13,786 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:13,791 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), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 27
[2025-04-28 21:21:13,791 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:13,813 INFO  L225             Difference]: With dead ends: 48
[2025-04-28 21:21:13,813 INFO  L226             Difference]: Without dead ends: 48
[2025-04-28 21:21:13,815 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:13,823 INFO  L437           NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:13,828 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 235 Invalid, 28 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:13,856 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2025-04-28 21:21:13,890 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46.
[2025-04-28 21:21:13,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 46 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 25 states have internal predecessors, (25), 15 states have call successors, (15), 9 states have call predecessors, (15), 11 states have return successors, (18), 11 states have call predecessors, (18), 15 states have call successors, (18)
[2025-04-28 21:21:13,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions.
[2025-04-28 21:21:13,903 INFO  L79                 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 27
[2025-04-28 21:21:13,903 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:13,904 INFO  L485      AbstractCegarLoop]: Abstraction has 46 states and 58 transitions.
[2025-04-28 21:21:13,904 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), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:13,904 INFO  L278                IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions.
[2025-04-28 21:21:13,906 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-04-28 21:21:13,908 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:13,909 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:13,909 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:13,909 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:13,910 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:13,911 INFO  L85        PathProgramCache]: Analyzing trace with hash -2029014085, now seen corresponding path program 1 times
[2025-04-28 21:21:13,911 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:13,912 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336458722]
[2025-04-28 21:21:13,912 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:13,912 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:13,947 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-04-28 21:21:13,970 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:21:13,974 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:13,974 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:14,580 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:14,581 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:14,581 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336458722]
[2025-04-28 21:21:14,581 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336458722] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:14,581 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:14,581 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-04-28 21:21:14,581 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066139192]
[2025-04-28 21:21:14,582 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:14,583 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:14,583 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:14,584 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:14,584 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:14,584 INFO  L87              Difference]: Start difference. First operand 46 states and 58 transitions. Second operand  has 9 states, 5 states have (on average 3.2) internal successors, (16), 9 states have internal predecessors, (16), 6 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9)
[2025-04-28 21:21:14,865 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:14,865 INFO  L93              Difference]: Finished difference Result 56 states and 72 transitions.
[2025-04-28 21:21:14,866 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:14,866 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 5 states have (on average 3.2) internal successors, (16), 9 states have internal predecessors, (16), 6 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 35
[2025-04-28 21:21:14,867 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:14,868 INFO  L225             Difference]: With dead ends: 56
[2025-04-28 21:21:14,868 INFO  L226             Difference]: Without dead ends: 56
[2025-04-28 21:21:14,868 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:14,869 INFO  L437           NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:14,869 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 363 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:14,870 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2025-04-28 21:21:14,877 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48.
[2025-04-28 21:21:14,877 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48 states, 20 states have (on average 1.3) internal successors, (26), 26 states have internal predecessors, (26), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (20), 12 states have call predecessors, (20), 15 states have call successors, (20)
[2025-04-28 21:21:14,878 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions.
[2025-04-28 21:21:14,878 INFO  L79                 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 35
[2025-04-28 21:21:14,879 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:14,879 INFO  L485      AbstractCegarLoop]: Abstraction has 48 states and 61 transitions.
[2025-04-28 21:21:14,879 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 5 states have (on average 3.2) internal successors, (16), 9 states have internal predecessors, (16), 6 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9)
[2025-04-28 21:21:14,879 INFO  L278                IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions.
[2025-04-28 21:21:14,880 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-04-28 21:21:14,880 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:14,881 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:14,881 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:14,881 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:14,881 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:14,881 INFO  L85        PathProgramCache]: Analyzing trace with hash -1334990277, now seen corresponding path program 1 times
[2025-04-28 21:21:14,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:14,882 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891029981]
[2025-04-28 21:21:14,882 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:14,882 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:14,892 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-04-28 21:21:14,901 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:21:14,901 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:14,901 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:15,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:15,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:15,310 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891029981]
[2025-04-28 21:21:15,310 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891029981] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:15,310 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:15,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-04-28 21:21:15,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041428865]
[2025-04-28 21:21:15,311 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:15,311 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:15,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:15,312 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:15,312 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:15,313 INFO  L87              Difference]: Start difference. First operand 48 states and 61 transitions. Second operand  has 9 states, 5 states have (on average 3.2) internal successors, (16), 9 states have internal predecessors, (16), 6 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9)
[2025-04-28 21:21:15,527 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:15,527 INFO  L93              Difference]: Finished difference Result 60 states and 77 transitions.
[2025-04-28 21:21:15,527 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:15,528 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 5 states have (on average 3.2) internal successors, (16), 9 states have internal predecessors, (16), 6 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 35
[2025-04-28 21:21:15,528 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:15,529 INFO  L225             Difference]: With dead ends: 60
[2025-04-28 21:21:15,529 INFO  L226             Difference]: Without dead ends: 60
[2025-04-28 21:21:15,530 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:15,531 INFO  L437           NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:15,531 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 356 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:15,535 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2025-04-28 21:21:15,549 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54.
[2025-04-28 21:21:15,550 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 29 states have internal predecessors, (29), 15 states have call successors, (15), 9 states have call predecessors, (15), 15 states have return successors, (25), 15 states have call predecessors, (25), 15 states have call successors, (25)
[2025-04-28 21:21:15,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions.
[2025-04-28 21:21:15,551 INFO  L79                 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 35
[2025-04-28 21:21:15,552 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:15,552 INFO  L485      AbstractCegarLoop]: Abstraction has 54 states and 69 transitions.
[2025-04-28 21:21:15,552 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 5 states have (on average 3.2) internal successors, (16), 9 states have internal predecessors, (16), 6 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9)
[2025-04-28 21:21:15,552 INFO  L278                IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions.
[2025-04-28 21:21:15,555 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2025-04-28 21:21:15,555 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:15,556 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:15,556 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:15,556 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:15,556 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:15,557 INFO  L85        PathProgramCache]: Analyzing trace with hash 1053622044, now seen corresponding path program 1 times
[2025-04-28 21:21:15,557 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:15,557 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754744202]
[2025-04-28 21:21:15,557 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:15,557 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:15,576 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-04-28 21:21:15,590 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-04-28 21:21:15,592 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:15,593 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:15,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:15,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:15,934 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754744202]
[2025-04-28 21:21:15,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754744202] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:15,934 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230270525]
[2025-04-28 21:21:15,934 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:15,935 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:15,939 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:15,943 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:15,946 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:16,038 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-04-28 21:21:16,108 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-04-28 21:21:16,108 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:16,108 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:16,111 INFO  L256         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:16,119 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:16,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:16,224 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:16,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230270525] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:16,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:16,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8
[2025-04-28 21:21:16,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554322417]
[2025-04-28 21:21:16,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:16,225 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:16,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:16,226 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:16,227 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:16,227 INFO  L87              Difference]: Start difference. First operand 54 states and 69 transitions. Second operand  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:16,252 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:16,252 INFO  L93              Difference]: Finished difference Result 58 states and 74 transitions.
[2025-04-28 21:21:16,254 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:16,254 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 39
[2025-04-28 21:21:16,255 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:16,256 INFO  L225             Difference]: With dead ends: 58
[2025-04-28 21:21:16,258 INFO  L226             Difference]: Without dead ends: 58
[2025-04-28 21:21:16,258 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:16,259 INFO  L437           NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:16,260 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:16,260 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2025-04-28 21:21:16,271 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56.
[2025-04-28 21:21:16,274 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 56 states, 24 states have (on average 1.25) internal successors, (30), 30 states have internal predecessors, (30), 15 states have call successors, (15), 9 states have call predecessors, (15), 16 states have return successors, (26), 16 states have call predecessors, (26), 15 states have call successors, (26)
[2025-04-28 21:21:16,276 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions.
[2025-04-28 21:21:16,278 INFO  L79                 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 39
[2025-04-28 21:21:16,278 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:16,278 INFO  L485      AbstractCegarLoop]: Abstraction has 56 states and 71 transitions.
[2025-04-28 21:21:16,278 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:16,278 INFO  L278                IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions.
[2025-04-28 21:21:16,280 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2025-04-28 21:21:16,280 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:16,280 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:16,286 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:16,481 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:16,481 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:16,482 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:16,482 INFO  L85        PathProgramCache]: Analyzing trace with hash 612483832, now seen corresponding path program 1 times
[2025-04-28 21:21:16,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:16,483 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458891801]
[2025-04-28 21:21:16,483 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:16,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:16,502 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes.
[2025-04-28 21:21:16,520 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements.
[2025-04-28 21:21:16,521 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:16,522 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:16,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:16,847 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:16,847 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458891801]
[2025-04-28 21:21:16,847 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458891801] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:16,847 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133889080]
[2025-04-28 21:21:16,848 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:16,848 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:16,852 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:16,854 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:16,858 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:16,945 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes.
[2025-04-28 21:21:17,007 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements.
[2025-04-28 21:21:17,007 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:17,007 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:17,009 INFO  L256         TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:17,012 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:17,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:17,106 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:18,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:18,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [133889080] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:18,239 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:18,239 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10
[2025-04-28 21:21:18,239 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513248785]
[2025-04-28 21:21:18,239 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:18,240 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:18,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:18,242 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:18,242 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:18,243 INFO  L87              Difference]: Start difference. First operand 56 states and 71 transitions. Second operand  has 10 states, 5 states have (on average 5.0) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 8 states have call successors, (15)
[2025-04-28 21:21:18,317 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:18,317 INFO  L93              Difference]: Finished difference Result 62 states and 77 transitions.
[2025-04-28 21:21:18,317 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:18,318 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 5 states have (on average 5.0) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 8 states have call successors, (15) Word has length 43
[2025-04-28 21:21:18,318 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:18,319 INFO  L225             Difference]: With dead ends: 62
[2025-04-28 21:21:18,321 INFO  L226             Difference]: Without dead ends: 62
[2025-04-28 21:21:18,322 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:18,323 INFO  L437           NwaCegarLoop]: 55 mSDtfsCounter, 7 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:18,325 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:18,325 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 62 states.
[2025-04-28 21:21:18,338 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54.
[2025-04-28 21:21:18,341 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 29 states have internal predecessors, (29), 15 states have call successors, (15), 9 states have call predecessors, (15), 15 states have return successors, (23), 15 states have call predecessors, (23), 15 states have call successors, (23)
[2025-04-28 21:21:18,342 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions.
[2025-04-28 21:21:18,342 INFO  L79                 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 43
[2025-04-28 21:21:18,342 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:18,342 INFO  L485      AbstractCegarLoop]: Abstraction has 54 states and 67 transitions.
[2025-04-28 21:21:18,342 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 5 states have (on average 5.0) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 8 states have call successors, (15)
[2025-04-28 21:21:18,343 INFO  L278                IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions.
[2025-04-28 21:21:18,344 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2025-04-28 21:21:18,344 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:18,344 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:18,352 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:18,545 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:18,545 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:18,546 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:18,546 INFO  L85        PathProgramCache]: Analyzing trace with hash 977105361, now seen corresponding path program 1 times
[2025-04-28 21:21:18,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:18,546 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185513476]
[2025-04-28 21:21:18,546 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:18,546 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:18,558 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes.
[2025-04-28 21:21:18,572 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements.
[2025-04-28 21:21:18,573 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:18,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:18,856 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:18,857 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:18,857 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185513476]
[2025-04-28 21:21:18,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185513476] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:18,857 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564269788]
[2025-04-28 21:21:18,857 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:18,857 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:18,860 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:18,862 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:18,867 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:18,963 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes.
[2025-04-28 21:21:19,014 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements.
[2025-04-28 21:21:19,015 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:19,015 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:19,017 INFO  L256         TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:19,019 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:19,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:19,094 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:20,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:20,276 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [564269788] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:20,277 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:20,277 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10
[2025-04-28 21:21:20,277 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246686162]
[2025-04-28 21:21:20,277 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:20,277 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:20,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:20,278 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:20,278 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:20,279 INFO  L87              Difference]: Start difference. First operand 54 states and 67 transitions. Second operand  has 10 states, 5 states have (on average 5.0) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 8 states have call successors, (15)
[2025-04-28 21:21:20,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:20,348 INFO  L93              Difference]: Finished difference Result 58 states and 70 transitions.
[2025-04-28 21:21:20,348 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:20,348 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 5 states have (on average 5.0) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 8 states have call successors, (15) Word has length 43
[2025-04-28 21:21:20,349 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:20,350 INFO  L225             Difference]: With dead ends: 58
[2025-04-28 21:21:20,350 INFO  L226             Difference]: Without dead ends: 58
[2025-04-28 21:21:20,350 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:20,351 INFO  L437           NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:20,351 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 304 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:20,352 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2025-04-28 21:21:20,357 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56.
[2025-04-28 21:21:20,357 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 56 states, 24 states have (on average 1.25) internal successors, (30), 30 states have internal predecessors, (30), 15 states have call successors, (15), 9 states have call predecessors, (15), 16 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23)
[2025-04-28 21:21:20,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions.
[2025-04-28 21:21:20,358 INFO  L79                 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 43
[2025-04-28 21:21:20,359 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:20,359 INFO  L485      AbstractCegarLoop]: Abstraction has 56 states and 68 transitions.
[2025-04-28 21:21:20,359 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 5 states have (on average 5.0) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 8 states have call successors, (15)
[2025-04-28 21:21:20,359 INFO  L278                IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions.
[2025-04-28 21:21:20,360 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2025-04-28 21:21:20,360 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:20,360 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:20,366 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:21:20,564 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:20,565 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:20,565 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:20,566 INFO  L85        PathProgramCache]: Analyzing trace with hash -193637966, now seen corresponding path program 2 times
[2025-04-28 21:21:20,566 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:20,566 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009179356]
[2025-04-28 21:21:20,566 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:20,567 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:20,585 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes.
[2025-04-28 21:21:20,611 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements.
[2025-04-28 21:21:20,612 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:20,612 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:20,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:21:20,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:20,917 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009179356]
[2025-04-28 21:21:20,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009179356] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:20,917 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603131323]
[2025-04-28 21:21:20,917 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:20,917 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:20,920 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:20,923 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:20,927 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:21,014 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes.
[2025-04-28 21:21:21,069 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements.
[2025-04-28 21:21:21,069 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:21,069 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:21,071 INFO  L256         TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:21,074 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:21,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:21:21,150 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:22,938 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:21:22,939 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603131323] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:22,939 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:22,939 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10
[2025-04-28 21:21:22,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912177315]
[2025-04-28 21:21:22,939 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:22,941 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:22,941 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:22,942 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:22,942 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:22,942 INFO  L87              Difference]: Start difference. First operand 56 states and 68 transitions. Second operand  has 10 states, 5 states have (on average 4.8) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 8 states have call successors, (15)
[2025-04-28 21:21:23,002 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:23,002 INFO  L93              Difference]: Finished difference Result 60 states and 73 transitions.
[2025-04-28 21:21:23,006 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:23,007 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 5 states have (on average 4.8) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 8 states have call successors, (15) Word has length 47
[2025-04-28 21:21:23,007 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:23,008 INFO  L225             Difference]: With dead ends: 60
[2025-04-28 21:21:23,008 INFO  L226             Difference]: Without dead ends: 60
[2025-04-28 21:21:23,008 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:23,009 INFO  L437           NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:23,009 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 289 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:23,010 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2025-04-28 21:21:23,021 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58.
[2025-04-28 21:21:23,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 58 states, 25 states have (on average 1.24) internal successors, (31), 31 states have internal predecessors, (31), 15 states have call successors, (15), 9 states have call predecessors, (15), 17 states have return successors, (24), 17 states have call predecessors, (24), 15 states have call successors, (24)
[2025-04-28 21:21:23,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions.
[2025-04-28 21:21:23,022 INFO  L79                 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 47
[2025-04-28 21:21:23,022 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:23,022 INFO  L485      AbstractCegarLoop]: Abstraction has 58 states and 70 transitions.
[2025-04-28 21:21:23,022 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 5 states have (on average 4.8) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 8 states have call successors, (15)
[2025-04-28 21:21:23,023 INFO  L278                IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions.
[2025-04-28 21:21:23,024 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-04-28 21:21:23,024 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:23,024 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:23,031 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:23,224 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:23,225 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:23,225 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:23,225 INFO  L85        PathProgramCache]: Analyzing trace with hash -1108667019, now seen corresponding path program 2 times
[2025-04-28 21:21:23,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:23,225 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4073131]
[2025-04-28 21:21:23,226 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:23,226 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:23,239 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes.
[2025-04-28 21:21:23,260 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements.
[2025-04-28 21:21:23,260 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:23,260 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:23,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-04-28 21:21:23,607 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:23,607 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4073131]
[2025-04-28 21:21:23,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4073131] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:23,608 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931630381]
[2025-04-28 21:21:23,608 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:23,609 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:23,611 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:23,613 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:23,618 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:23,718 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes.
[2025-04-28 21:21:23,781 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements.
[2025-04-28 21:21:23,782 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:23,782 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:23,784 INFO  L256         TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 27 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:23,787 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:23,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-04-28 21:21:23,862 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:27,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-04-28 21:21:27,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [931630381] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:27,043 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:27,044 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13
[2025-04-28 21:21:27,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270632754]
[2025-04-28 21:21:27,044 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:27,044 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:27,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:27,045 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:27,046 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:27,046 INFO  L87              Difference]: Start difference. First operand 58 states and 70 transitions. Second operand  has 13 states, 6 states have (on average 4.5) internal successors, (27), 13 states have internal predecessors, (27), 10 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 5 states have call predecessors, (17), 10 states have call successors, (17)
[2025-04-28 21:21:27,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:27,131 INFO  L93              Difference]: Finished difference Result 62 states and 75 transitions.
[2025-04-28 21:21:27,131 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:27,132 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 6 states have (on average 4.5) internal successors, (27), 13 states have internal predecessors, (27), 10 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 5 states have call predecessors, (17), 10 states have call successors, (17) Word has length 51
[2025-04-28 21:21:27,132 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:27,133 INFO  L225             Difference]: With dead ends: 62
[2025-04-28 21:21:27,133 INFO  L226             Difference]: Without dead ends: 62
[2025-04-28 21:21:27,133 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:27,134 INFO  L437           NwaCegarLoop]: 53 mSDtfsCounter, 11 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:27,134 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 294 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:27,135 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 62 states.
[2025-04-28 21:21:27,146 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60.
[2025-04-28 21:21:27,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 32 states have internal predecessors, (32), 15 states have call successors, (15), 9 states have call predecessors, (15), 18 states have return successors, (25), 18 states have call predecessors, (25), 15 states have call successors, (25)
[2025-04-28 21:21:27,147 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions.
[2025-04-28 21:21:27,150 INFO  L79                 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 51
[2025-04-28 21:21:27,150 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:27,151 INFO  L485      AbstractCegarLoop]: Abstraction has 60 states and 72 transitions.
[2025-04-28 21:21:27,151 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 6 states have (on average 4.5) internal successors, (27), 13 states have internal predecessors, (27), 10 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 5 states have call predecessors, (17), 10 states have call successors, (17)
[2025-04-28 21:21:27,151 INFO  L278                IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions.
[2025-04-28 21:21:27,152 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-04-28 21:21:27,152 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,152 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:27,164 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:27,356 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:27,357 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,357 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,357 INFO  L85        PathProgramCache]: Analyzing trace with hash 1694400618, now seen corresponding path program 3 times
[2025-04-28 21:21:27,357 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,357 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297456581]
[2025-04-28 21:21:27,357 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:27,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,374 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 4 equivalence classes.
[2025-04-28 21:21:27,397 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 55 statements.
[2025-04-28 21:21:27,398 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2025-04-28 21:21:27,398 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:27,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-04-28 21:21:27,842 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:27,842 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297456581]
[2025-04-28 21:21:27,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297456581] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:27,842 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:27,842 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:27,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787760156]
[2025-04-28 21:21:27,842 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:27,843 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:27,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:27,843 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:27,843 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:27,844 INFO  L87              Difference]: Start difference. First operand 60 states and 72 transitions. Second operand  has 6 states, 4 states have (on average 4.75) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-04-28 21:21:27,939 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:27,940 INFO  L93              Difference]: Finished difference Result 62 states and 74 transitions.
[2025-04-28 21:21:27,940 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:27,940 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 4.75) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 55
[2025-04-28 21:21:27,941 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:27,941 INFO  L225             Difference]: With dead ends: 62
[2025-04-28 21:21:27,945 INFO  L226             Difference]: Without dead ends: 60
[2025-04-28 21:21:27,945 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:27,946 INFO  L437           NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:27,946 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 217 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:27,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2025-04-28 21:21:27,951 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58.
[2025-04-28 21:21:27,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 58 states, 25 states have (on average 1.24) internal successors, (31), 31 states have internal predecessors, (31), 15 states have call successors, (15), 9 states have call predecessors, (15), 17 states have return successors, (23), 17 states have call predecessors, (23), 15 states have call successors, (23)
[2025-04-28 21:21:27,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions.
[2025-04-28 21:21:27,955 INFO  L79                 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 55
[2025-04-28 21:21:27,958 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:27,958 INFO  L485      AbstractCegarLoop]: Abstraction has 58 states and 69 transitions.
[2025-04-28 21:21:27,959 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 4.75) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-04-28 21:21:27,959 INFO  L278                IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions.
[2025-04-28 21:21:27,960 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-04-28 21:21:27,960 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,960 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:27,960 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-04-28 21:21:27,960 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,960 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,961 INFO  L85        PathProgramCache]: Analyzing trace with hash -1200787748, now seen corresponding path program 3 times
[2025-04-28 21:21:27,961 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,961 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869525594]
[2025-04-28 21:21:27,962 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:27,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,978 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 4 equivalence classes.
[2025-04-28 21:21:27,995 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 55 statements.
[2025-04-28 21:21:27,996 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2025-04-28 21:21:27,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,198 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-04-28 21:21:28,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:28,201 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869525594]
[2025-04-28 21:21:28,202 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869525594] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:28,202 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:28,202 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:28,202 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847240823]
[2025-04-28 21:21:28,202 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:28,202 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:28,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:28,203 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:28,203 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:28,203 INFO  L87              Difference]: Start difference. First operand 58 states and 69 transitions. Second operand  has 6 states, 4 states have (on average 4.75) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-04-28 21:21:28,269 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:28,270 INFO  L93              Difference]: Finished difference Result 62 states and 73 transitions.
[2025-04-28 21:21:28,270 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:28,271 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 4.75) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 55
[2025-04-28 21:21:28,271 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:28,272 INFO  L225             Difference]: With dead ends: 62
[2025-04-28 21:21:28,274 INFO  L226             Difference]: Without dead ends: 60
[2025-04-28 21:21:28,274 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:28,275 INFO  L437           NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:28,275 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 222 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:28,276 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2025-04-28 21:21:28,281 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2025-04-28 21:21:28,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 32 states have internal predecessors, (32), 15 states have call successors, (15), 9 states have call predecessors, (15), 18 states have return successors, (24), 18 states have call predecessors, (24), 15 states have call successors, (24)
[2025-04-28 21:21:28,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions.
[2025-04-28 21:21:28,289 INFO  L79                 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 55
[2025-04-28 21:21:28,290 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:28,290 INFO  L485      AbstractCegarLoop]: Abstraction has 60 states and 71 transitions.
[2025-04-28 21:21:28,291 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 4.75) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-04-28 21:21:28,291 INFO  L278                IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions.
[2025-04-28 21:21:28,292 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2025-04-28 21:21:28,292 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:28,292 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:28,292 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-04-28 21:21:28,292 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:28,293 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:28,293 INFO  L85        PathProgramCache]: Analyzing trace with hash 1474008007, now seen corresponding path program 1 times
[2025-04-28 21:21:28,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:28,293 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052537011]
[2025-04-28 21:21:28,293 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:28,305 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes.
[2025-04-28 21:21:28,321 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements.
[2025-04-28 21:21:28,321 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,771 INFO  L134       CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2025-04-28 21:21:28,771 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:28,771 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052537011]
[2025-04-28 21:21:28,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052537011] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:28,771 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616602777]
[2025-04-28 21:21:28,771 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,771 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:28,774 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:28,776 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:28,779 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:28,904 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes.
[2025-04-28 21:21:28,963 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements.
[2025-04-28 21:21:28,963 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,963 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,966 INFO  L256         TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:28,969 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:29,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2025-04-28 21:21:29,055 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:34,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-04-28 21:21:34,082 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [616602777] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:34,082 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:34,082 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 15
[2025-04-28 21:21:34,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434057727]
[2025-04-28 21:21:34,083 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,083 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-04-28 21:21:34,083 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,084 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-04-28 21:21:34,084 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:34,084 INFO  L87              Difference]: Start difference. First operand 60 states and 71 transitions. Second operand  has 15 states, 7 states have (on average 4.285714285714286) internal successors, (30), 15 states have internal predecessors, (30), 11 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (20), 6 states have call predecessors, (20), 11 states have call successors, (20)
[2025-04-28 21:21:34,187 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,187 INFO  L93              Difference]: Finished difference Result 62 states and 73 transitions.
[2025-04-28 21:21:34,190 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:34,191 INFO  L79                 Accepts]: Start accepts. Automaton has  has 15 states, 7 states have (on average 4.285714285714286) internal successors, (30), 15 states have internal predecessors, (30), 11 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (20), 6 states have call predecessors, (20), 11 states have call successors, (20) Word has length 59
[2025-04-28 21:21:34,191 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,193 INFO  L225             Difference]: With dead ends: 62
[2025-04-28 21:21:34,193 INFO  L226             Difference]: Without dead ends: 62
[2025-04-28 21:21:34,193 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:34,194 INFO  L437           NwaCegarLoop]: 54 mSDtfsCounter, 14 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:34,196 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 394 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:34,196 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 62 states.
[2025-04-28 21:21:34,203 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62.
[2025-04-28 21:21:34,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 62 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 33 states have internal predecessors, (33), 15 states have call successors, (15), 9 states have call predecessors, (15), 19 states have return successors, (25), 19 states have call predecessors, (25), 15 states have call successors, (25)
[2025-04-28 21:21:34,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions.
[2025-04-28 21:21:34,204 INFO  L79                 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 59
[2025-04-28 21:21:34,204 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,204 INFO  L485      AbstractCegarLoop]: Abstraction has 62 states and 73 transitions.
[2025-04-28 21:21:34,205 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 7 states have (on average 4.285714285714286) internal successors, (30), 15 states have internal predecessors, (30), 11 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (20), 6 states have call predecessors, (20), 11 states have call successors, (20)
[2025-04-28 21:21:34,205 INFO  L278                IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions.
[2025-04-28 21:21:34,206 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2025-04-28 21:21:34,206 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,206 INFO  L218           NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:34,211 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:34,409 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:34,410 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,410 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,410 INFO  L85        PathProgramCache]: Analyzing trace with hash -1713691716, now seen corresponding path program 2 times
[2025-04-28 21:21:34,410 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,410 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679994409]
[2025-04-28 21:21:34,410 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:34,410 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,425 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes.
[2025-04-28 21:21:34,454 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements.
[2025-04-28 21:21:34,456 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:34,456 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,922 INFO  L134       CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2025-04-28 21:21:34,922 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,922 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679994409]
[2025-04-28 21:21:34,923 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679994409] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:34,923 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114217531]
[2025-04-28 21:21:34,923 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:34,923 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:34,926 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:34,928 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:34,932 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:35,094 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes.
[2025-04-28 21:21:35,159 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements.
[2025-04-28 21:21:35,159 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:35,159 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,162 INFO  L256         TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 41 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:35,164 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:35,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2025-04-28 21:21:35,238 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
