./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-150.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:46,586 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:46,694 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9dcf497-fdde-424c-8189-140eb37702f7/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:46,702 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:46,702 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:46,741 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:46,741 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:46,741 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:46,744 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:46,744 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:46,745 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:46,745 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:46,745 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:46,745 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:46,745 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:46,745 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:46,745 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:46,746 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:46,746 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:46,746 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:46,746 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:46,746 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:46,746 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:46,746 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:46,746 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:46,749 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:46,749 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:47,095 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:47,107 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:47,109 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:47,112 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:47,113 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:47,114 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9dcf497-fdde-424c-8189-140eb37702f7/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-150.smt2
[2025-04-28 21:21:47,117 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:47,124 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:47,821 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9dcf497-fdde-424c-8189-140eb37702f7/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-150.smt2
[2025-04-28 21:21:47,827 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:47,830 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:47,830 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:47,831 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:47,831 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:47,835 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,908 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47 Unit
[2025-04-28 21:21:47,909 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:47,912 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:47,913 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:47,913 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:47,926 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,926 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,968 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,969 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,980 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,982 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,985 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,988 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,989 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:48,015 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:48,016 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:48,017 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:48,017 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:48,018 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:48,021 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:48,045 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:48,060 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:48,064 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:48,076 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:48,076 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:48,076 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:48,076 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure CHC_COMP_FALSE given in one single declaration
[2025-04-28 21:21:48,076 INFO  L130     BoogieDeclarations]: Found specification of procedure CHC_COMP_FALSE
[2025-04-28 21:21:48,076 INFO  L138     BoogieDeclarations]: Found implementation of procedure CHC_COMP_FALSE
[2025-04-28 21:21:48,076 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration
[2025-04-28 21:21:48,076 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_MAIN_42
[2025-04-28 21:21:48,077 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_MAIN_42
[2025-04-28 21:21:48,077 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:48,077 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:48,077 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:48,217 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:48,221 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:48,890 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:48,890 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:48,907 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:48,907 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-04-28 21:21:48,908 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:48 BoogieIcfgContainer
[2025-04-28 21:21:48,908 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:48,914 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:48,914 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:48,919 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:48,920 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:47" (1/3) ...
[2025-04-28 21:21:48,921 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dab3604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:48, skipping insertion in model container
[2025-04-28 21:21:48,921 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (2/3) ...
[2025-04-28 21:21:48,921 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dab3604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:48, skipping insertion in model container
[2025-04-28 21:21:48,921 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:48" (3/3) ...
[2025-04-28 21:21:48,924 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:48,941 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:48,943 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 4 procedures, 99 locations, 281 edges, 4 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:48,994 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:49,006 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;@73ad5ce7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:49,006 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:49,011 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 99 states, 7 states have (on average 2.857142857142857) internal successors, (20), 20 states have internal predecessors, (20), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 76 states have call predecessors, (87), 87 states have call successors, (87)
[2025-04-28 21:21:49,061 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:49,061 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:49,062 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:49,062 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:49,069 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:49,069 INFO  L85        PathProgramCache]: Analyzing trace with hash 597694873, now seen corresponding path program 1 times
[2025-04-28 21:21:49,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:49,078 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022664950]
[2025-04-28 21:21:49,079 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:49,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:49,128 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:49,205 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:49,206 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:49,206 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:49,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:49,802 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022664950]
[2025-04-28 21:21:49,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022664950] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:49,803 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904254669]
[2025-04-28 21:21:49,803 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:49,803 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:49,806 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:49,810 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:49,815 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:49,906 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:49,973 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:49,973 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:49,974 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,978 INFO  L256         TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:49,985 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:50,311 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:50,312 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:50,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:50,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904254669] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:50,765 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:50,767 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11
[2025-04-28 21:21:50,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441241167]
[2025-04-28 21:21:50,770 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:50,774 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-04-28 21:21:50,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:50,825 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-04-28 21:21:50,826 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:50,829 INFO  L87              Difference]: Start difference. First operand  has 99 states, 7 states have (on average 2.857142857142857) internal successors, (20), 20 states have internal predecessors, (20), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 76 states have call predecessors, (87), 87 states have call successors, (87) Second operand  has 11 states, 5 states have (on average 2.8) internal successors, (14), 8 states have internal predecessors, (14), 8 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 8 states have call successors, (14)
[2025-04-28 21:21:53,133 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:53,134 INFO  L93              Difference]: Finished difference Result 151 states and 418 transitions.
[2025-04-28 21:21:53,139 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:53,140 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 5 states have (on average 2.8) internal successors, (14), 8 states have internal predecessors, (14), 8 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 8 states have call successors, (14) Word has length 24
[2025-04-28 21:21:53,140 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:53,160 INFO  L225             Difference]: With dead ends: 151
[2025-04-28 21:21:53,160 INFO  L226             Difference]: Without dead ends: 151
[2025-04-28 21:21:53,162 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:53,165 INFO  L437           NwaCegarLoop]: 153 mSDtfsCounter, 13 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:53,165 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 711 Invalid, 1506 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-04-28 21:21:53,181 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2025-04-28 21:21:53,366 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145.
[2025-04-28 21:21:53,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 145 states, 9 states have (on average 2.888888888888889) internal successors, (26), 25 states have internal predecessors, (26), 130 states have call successors, (130), 4 states have call predecessors, (130), 5 states have return successors, (256), 115 states have call predecessors, (256), 130 states have call successors, (256)
[2025-04-28 21:21:53,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 412 transitions.
[2025-04-28 21:21:53,388 INFO  L79                 Accepts]: Start accepts. Automaton has 145 states and 412 transitions. Word has length 24
[2025-04-28 21:21:53,389 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:53,389 INFO  L485      AbstractCegarLoop]: Abstraction has 145 states and 412 transitions.
[2025-04-28 21:21:53,389 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 5 states have (on average 2.8) internal successors, (14), 8 states have internal predecessors, (14), 8 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 8 states have call successors, (14)
[2025-04-28 21:21:53,390 INFO  L278                IsEmpty]: Start isEmpty. Operand 145 states and 412 transitions.
[2025-04-28 21:21:53,405 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:53,406 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:53,406 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:53,412 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:53,610 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:53,610 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:53,612 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:53,612 INFO  L85        PathProgramCache]: Analyzing trace with hash -1797676571, now seen corresponding path program 1 times
[2025-04-28 21:21:53,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:53,612 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153741463]
[2025-04-28 21:21:53,612 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:53,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:53,621 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:53,631 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:53,631 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:53,631 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:54,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:54,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:54,091 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153741463]
[2025-04-28 21:21:54,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153741463] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:54,091 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261076098]
[2025-04-28 21:21:54,091 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:54,092 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:54,094 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:54,096 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:54,100 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:54,166 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:54,206 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:54,206 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:54,206 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:54,209 INFO  L256         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 51 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:54,211 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:54,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:54,456 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:55,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:55,001 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261076098] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:55,002 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:55,002 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14
[2025-04-28 21:21:55,002 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331904987]
[2025-04-28 21:21:55,002 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:55,003 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-04-28 21:21:55,004 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:55,004 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-04-28 21:21:55,004 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:55,005 INFO  L87              Difference]: Start difference. First operand 145 states and 412 transitions. Second operand  has 14 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 9 states have internal predecessors, (16), 10 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13)
[2025-04-28 21:21:56,669 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:56,669 INFO  L93              Difference]: Finished difference Result 152 states and 424 transitions.
[2025-04-28 21:21:56,673 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:56,673 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 9 states have internal predecessors, (16), 10 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 24
[2025-04-28 21:21:56,673 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:56,681 INFO  L225             Difference]: With dead ends: 152
[2025-04-28 21:21:56,681 INFO  L226             Difference]: Without dead ends: 152
[2025-04-28 21:21:56,681 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:56,682 INFO  L437           NwaCegarLoop]: 111 mSDtfsCounter, 6 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:56,683 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 780 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-04-28 21:21:56,684 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2025-04-28 21:21:56,741 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147.
[2025-04-28 21:21:56,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 147 states, 9 states have (on average 2.888888888888889) internal successors, (26), 25 states have internal predecessors, (26), 132 states have call successors, (132), 4 states have call predecessors, (132), 5 states have return successors, (259), 117 states have call predecessors, (259), 132 states have call successors, (259)
[2025-04-28 21:21:56,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 417 transitions.
[2025-04-28 21:21:56,747 INFO  L79                 Accepts]: Start accepts. Automaton has 147 states and 417 transitions. Word has length 24
[2025-04-28 21:21:56,747 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:56,747 INFO  L485      AbstractCegarLoop]: Abstraction has 147 states and 417 transitions.
[2025-04-28 21:21:56,748 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 9 states have internal predecessors, (16), 10 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13)
[2025-04-28 21:21:56,748 INFO  L278                IsEmpty]: Start isEmpty. Operand 147 states and 417 transitions.
[2025-04-28 21:21:56,754 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:56,754 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:56,755 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:56,760 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:56,959 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:56,959 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:56,959 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:56,959 INFO  L85        PathProgramCache]: Analyzing trace with hash -1231409707, now seen corresponding path program 1 times
[2025-04-28 21:21:56,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:56,960 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902571607]
[2025-04-28 21:21:56,960 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:56,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:56,966 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:56,977 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:56,977 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:56,978 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:57,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:57,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:57,292 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902571607]
[2025-04-28 21:21:57,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902571607] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:57,292 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482413249]
[2025-04-28 21:21:57,292 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:57,292 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:57,295 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:57,297 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:57,301 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:57,359 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:57,395 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:57,395 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:57,395 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:57,398 INFO  L256         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 51 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:57,400 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:57,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:57,572 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:58,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:58,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [482413249] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:58,055 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:58,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12
[2025-04-28 21:21:58,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988777855]
[2025-04-28 21:21:58,055 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:58,056 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-04-28 21:21:58,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:58,057 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-04-28 21:21:58,057 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:58,058 INFO  L87              Difference]: Start difference. First operand 147 states and 417 transitions. Second operand  has 12 states, 5 states have (on average 3.2) internal successors, (16), 8 states have internal predecessors, (16), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12)
[2025-04-28 21:21:59,733 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:59,733 INFO  L93              Difference]: Finished difference Result 156 states and 431 transitions.
[2025-04-28 21:21:59,734 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:59,734 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 5 states have (on average 3.2) internal successors, (16), 8 states have internal predecessors, (16), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) Word has length 24
[2025-04-28 21:21:59,735 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:59,743 INFO  L225             Difference]: With dead ends: 156
[2025-04-28 21:21:59,743 INFO  L226             Difference]: Without dead ends: 156
[2025-04-28 21:21:59,743 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:59,746 INFO  L437           NwaCegarLoop]: 114 mSDtfsCounter, 8 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:59,749 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 699 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-04-28 21:21:59,750 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2025-04-28 21:21:59,825 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 149.
[2025-04-28 21:21:59,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 149 states, 9 states have (on average 2.888888888888889) internal successors, (26), 25 states have internal predecessors, (26), 134 states have call successors, (134), 4 states have call predecessors, (134), 5 states have return successors, (262), 119 states have call predecessors, (262), 134 states have call successors, (262)
[2025-04-28 21:21:59,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 422 transitions.
[2025-04-28 21:21:59,833 INFO  L79                 Accepts]: Start accepts. Automaton has 149 states and 422 transitions. Word has length 24
[2025-04-28 21:21:59,833 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:59,833 INFO  L485      AbstractCegarLoop]: Abstraction has 149 states and 422 transitions.
[2025-04-28 21:21:59,834 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 5 states have (on average 3.2) internal successors, (16), 8 states have internal predecessors, (16), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12)
[2025-04-28 21:21:59,834 INFO  L278                IsEmpty]: Start isEmpty. Operand 149 states and 422 transitions.
[2025-04-28 21:21:59,840 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:59,840 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:59,840 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:59,846 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:22:00,044 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:00,044 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:00,044 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:00,044 INFO  L85        PathProgramCache]: Analyzing trace with hash 999285393, now seen corresponding path program 1 times
[2025-04-28 21:22:00,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:00,045 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428115268]
[2025-04-28 21:22:00,045 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:00,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:00,050 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:22:00,057 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:22:00,058 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:00,058 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:00,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:22:00,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:00,254 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428115268]
[2025-04-28 21:22:00,254 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428115268] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:00,254 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202601955]
[2025-04-28 21:22:00,254 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:00,254 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:00,257 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:00,259 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:22:00,262 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:22:00,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:22:00,349 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:22:00,349 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:00,349 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:00,353 INFO  L256         TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 26 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:00,355 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:00,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:22:00,432 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:00,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:22:00,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202601955] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:00,686 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:00,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 9
[2025-04-28 21:22:00,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034315949]
[2025-04-28 21:22:00,687 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:00,687 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:22:00,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:00,689 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:22:00,689 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:22:00,689 INFO  L87              Difference]: Start difference. First operand 149 states and 422 transitions. Second operand  has 9 states, 5 states have (on average 3.2) internal successors, (16), 8 states have internal predecessors, (16), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 2 states have call predecessors, (11), 6 states have call successors, (11)
[2025-04-28 21:22:01,767 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:01,768 INFO  L93              Difference]: Finished difference Result 153 states and 425 transitions.
[2025-04-28 21:22:01,768 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:22:01,768 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 5 states have (on average 3.2) internal successors, (16), 8 states have internal predecessors, (16), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 2 states have call predecessors, (11), 6 states have call successors, (11) Word has length 24
[2025-04-28 21:22:01,769 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:01,774 INFO  L225             Difference]: With dead ends: 153
[2025-04-28 21:22:01,774 INFO  L226             Difference]: Without dead ends: 153
[2025-04-28 21:22:01,775 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:22:01,775 INFO  L437           NwaCegarLoop]: 115 mSDtfsCounter, 3 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:01,776 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 603 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-04-28 21:22:01,776 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 153 states.
[2025-04-28 21:22:01,851 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149.
[2025-04-28 21:22:01,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 149 states, 9 states have (on average 2.888888888888889) internal successors, (26), 25 states have internal predecessors, (26), 134 states have call successors, (134), 4 states have call predecessors, (134), 5 states have return successors, (261), 119 states have call predecessors, (261), 134 states have call successors, (261)
[2025-04-28 21:22:01,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 421 transitions.
[2025-04-28 21:22:01,858 INFO  L79                 Accepts]: Start accepts. Automaton has 149 states and 421 transitions. Word has length 24
[2025-04-28 21:22:01,859 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:01,859 INFO  L485      AbstractCegarLoop]: Abstraction has 149 states and 421 transitions.
[2025-04-28 21:22:01,859 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 5 states have (on average 3.2) internal successors, (16), 8 states have internal predecessors, (16), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 2 states have call predecessors, (11), 6 states have call successors, (11)
[2025-04-28 21:22:01,859 INFO  L278                IsEmpty]: Start isEmpty. Operand 149 states and 421 transitions.
[2025-04-28 21:22:01,868 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:22:01,869 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:01,869 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:01,877 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:22:02,073 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:02,073 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:02,074 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:02,074 INFO  L85        PathProgramCache]: Analyzing trace with hash 267853987, now seen corresponding path program 1 times
[2025-04-28 21:22:02,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:02,074 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27338201]
[2025-04-28 21:22:02,075 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:02,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:02,083 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:22:02,090 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:22:02,091 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:02,091 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:02,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2025-04-28 21:22:02,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:02,183 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27338201]
[2025-04-28 21:22:02,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27338201] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:02,183 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:02,183 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:22:02,183 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276117887]
[2025-04-28 21:22:02,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:02,184 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:22:02,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:02,184 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:22:02,184 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:22:02,185 INFO  L87              Difference]: Start difference. First operand 149 states and 421 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2025-04-28 21:22:02,680 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:02,680 INFO  L93              Difference]: Finished difference Result 151 states and 422 transitions.
[2025-04-28 21:22:02,681 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:22:02,681 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 32
[2025-04-28 21:22:02,682 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:02,687 INFO  L225             Difference]: With dead ends: 151
[2025-04-28 21:22:02,687 INFO  L226             Difference]: Without dead ends: 151
[2025-04-28 21:22:02,687 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:22:02,688 INFO  L437           NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:02,688 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 241 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:22:02,689 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2025-04-28 21:22:02,739 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149.
[2025-04-28 21:22:02,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 149 states, 9 states have (on average 2.888888888888889) internal successors, (26), 25 states have internal predecessors, (26), 134 states have call successors, (134), 4 states have call predecessors, (134), 5 states have return successors, (260), 119 states have call predecessors, (260), 134 states have call successors, (260)
[2025-04-28 21:22:02,744 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 420 transitions.
[2025-04-28 21:22:02,745 INFO  L79                 Accepts]: Start accepts. Automaton has 149 states and 420 transitions. Word has length 32
[2025-04-28 21:22:02,745 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:02,745 INFO  L485      AbstractCegarLoop]: Abstraction has 149 states and 420 transitions.
[2025-04-28 21:22:02,746 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2025-04-28 21:22:02,746 INFO  L278                IsEmpty]: Start isEmpty. Operand 149 states and 420 transitions.
[2025-04-28 21:22:02,756 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:22:02,756 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:02,756 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:02,756 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:22:02,756 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:02,757 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:02,757 INFO  L85        PathProgramCache]: Analyzing trace with hash -282714289, now seen corresponding path program 1 times
[2025-04-28 21:22:02,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:02,757 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749145820]
[2025-04-28 21:22:02,758 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:02,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:02,769 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:22:02,778 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:22:02,779 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:02,779 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:02,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2025-04-28 21:22:02,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:02,864 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749145820]
[2025-04-28 21:22:02,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749145820] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:02,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:02,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:22:02,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453021938]
[2025-04-28 21:22:02,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:02,865 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:22:02,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:02,865 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:22:02,866 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:22:02,866 INFO  L87              Difference]: Start difference. First operand 149 states and 420 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2025-04-28 21:22:03,363 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:03,363 INFO  L93              Difference]: Finished difference Result 151 states and 421 transitions.
[2025-04-28 21:22:03,363 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:22:03,364 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 32
[2025-04-28 21:22:03,364 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:03,369 INFO  L225             Difference]: With dead ends: 151
[2025-04-28 21:22:03,370 INFO  L226             Difference]: Without dead ends: 151
[2025-04-28 21:22:03,370 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:22:03,370 INFO  L437           NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:03,371 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:22:03,371 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2025-04-28 21:22:03,430 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149.
[2025-04-28 21:22:03,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 149 states, 9 states have (on average 2.888888888888889) internal successors, (26), 25 states have internal predecessors, (26), 134 states have call successors, (134), 4 states have call predecessors, (134), 5 states have return successors, (259), 119 states have call predecessors, (259), 134 states have call successors, (259)
[2025-04-28 21:22:03,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 419 transitions.
[2025-04-28 21:22:03,435 INFO  L79                 Accepts]: Start accepts. Automaton has 149 states and 419 transitions. Word has length 32
[2025-04-28 21:22:03,435 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:03,435 INFO  L485      AbstractCegarLoop]: Abstraction has 149 states and 419 transitions.
[2025-04-28 21:22:03,436 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2025-04-28 21:22:03,436 INFO  L278                IsEmpty]: Start isEmpty. Operand 149 states and 419 transitions.
[2025-04-28 21:22:03,448 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-04-28 21:22:03,448 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:03,448 INFO  L218           NwaCegarLoop]: trace histogram [18, 16, 2, 2, 2, 2, 2, 2, 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]
[2025-04-28 21:22:03,448 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-04-28 21:22:03,448 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:03,449 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:03,449 INFO  L85        PathProgramCache]: Analyzing trace with hash 1882498411, now seen corresponding path program 1 times
[2025-04-28 21:22:03,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:03,450 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132668511]
[2025-04-28 21:22:03,450 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:03,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:03,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-04-28 21:22:03,475 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-04-28 21:22:03,475 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:03,475 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:03,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 465 backedges. 43 proven. 27 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked.
[2025-04-28 21:22:03,804 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:03,804 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132668511]
[2025-04-28 21:22:03,804 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132668511] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:03,804 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060929224]
[2025-04-28 21:22:03,804 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:03,804 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:03,807 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:03,809 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:22:03,813 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:22:03,901 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-04-28 21:22:04,044 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-04-28 21:22:04,044 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:04,044 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:04,049 INFO  L256         TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:04,053 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:04,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 465 backedges. 41 proven. 61 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked.
[2025-04-28 21:22:04,206 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:04,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 465 backedges. 41 proven. 61 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked.
[2025-04-28 21:22:04,859 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060929224] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:04,859 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:04,860 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 13
[2025-04-28 21:22:04,860 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819871201]
[2025-04-28 21:22:04,860 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:04,860 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:22:04,860 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:04,861 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:22:04,861 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:22:04,861 INFO  L87              Difference]: Start difference. First operand 149 states and 419 transitions. Second operand  has 13 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 12 states have internal predecessors, (19), 10 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 10 states have call successors, (34)
[2025-04-28 21:22:08,665 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:08,666 INFO  L93              Difference]: Finished difference Result 228 states and 1155 transitions.
[2025-04-28 21:22:08,666 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:22:08,666 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 12 states have internal predecessors, (19), 10 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 10 states have call successors, (34) Word has length 80
[2025-04-28 21:22:08,666 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:08,682 INFO  L225             Difference]: With dead ends: 228
[2025-04-28 21:22:08,682 INFO  L226             Difference]: Without dead ends: 228
[2025-04-28 21:22:08,682 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:22:08,683 INFO  L437           NwaCegarLoop]: 151 mSDtfsCounter, 14 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 3823 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 4015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 3823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:08,683 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 628 Invalid, 4015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 3823 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time]
[2025-04-28 21:22:08,684 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 228 states.
[2025-04-28 21:22:08,948 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 203.
[2025-04-28 21:22:08,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 203 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 32 states have internal predecessors, (34), 183 states have call successors, (183), 5 states have call predecessors, (183), 7 states have return successors, (532), 165 states have call predecessors, (532), 183 states have call successors, (532)
[2025-04-28 21:22:08,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 749 transitions.
[2025-04-28 21:22:08,957 INFO  L79                 Accepts]: Start accepts. Automaton has 203 states and 749 transitions. Word has length 80
[2025-04-28 21:22:08,958 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:08,958 INFO  L485      AbstractCegarLoop]: Abstraction has 203 states and 749 transitions.
[2025-04-28 21:22:08,958 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 12 states have internal predecessors, (19), 10 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 10 states have call successors, (34)
[2025-04-28 21:22:08,959 INFO  L278                IsEmpty]: Start isEmpty. Operand 203 states and 749 transitions.
[2025-04-28 21:22:08,974 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-04-28 21:22:08,974 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:08,974 INFO  L218           NwaCegarLoop]: trace histogram [18, 16, 2, 2, 2, 2, 2, 2, 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]
[2025-04-28 21:22:08,982 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-04-28 21:22:09,178 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:09,178 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:09,180 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:09,180 INFO  L85        PathProgramCache]: Analyzing trace with hash 1464983231, now seen corresponding path program 1 times
[2025-04-28 21:22:09,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:09,181 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444725887]
[2025-04-28 21:22:09,181 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:09,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:09,196 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-04-28 21:22:09,205 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-04-28 21:22:09,205 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:09,205 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:09,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 465 backedges. 43 proven. 27 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked.
[2025-04-28 21:22:09,506 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:09,506 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444725887]
[2025-04-28 21:22:09,506 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444725887] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:09,506 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861082069]
[2025-04-28 21:22:09,506 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:09,506 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:09,509 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:09,511 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:22:09,514 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:22:09,606 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-04-28 21:22:09,741 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-04-28 21:22:09,742 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:09,742 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:09,747 INFO  L256         TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:09,750 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:09,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 465 backedges. 41 proven. 61 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked.
[2025-04-28 21:22:09,886 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:10,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 465 backedges. 41 proven. 61 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked.
[2025-04-28 21:22:10,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861082069] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:10,498 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:10,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 13
[2025-04-28 21:22:10,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291412452]
[2025-04-28 21:22:10,498 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:10,499 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:22:10,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:10,499 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:22:10,499 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:22:10,500 INFO  L87              Difference]: Start difference. First operand 203 states and 749 transitions. Second operand  has 13 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 12 states have internal predecessors, (19), 10 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 10 states have call successors, (34)
[2025-04-28 21:22:13,909 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:13,909 INFO  L93              Difference]: Finished difference Result 279 states and 1423 transitions.
[2025-04-28 21:22:13,909 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:22:13,910 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 12 states have internal predecessors, (19), 10 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 10 states have call successors, (34) Word has length 80
[2025-04-28 21:22:13,910 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:13,925 INFO  L225             Difference]: With dead ends: 279
[2025-04-28 21:22:13,925 INFO  L226             Difference]: Without dead ends: 279
[2025-04-28 21:22:13,926 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:22:13,926 INFO  L437           NwaCegarLoop]: 158 mSDtfsCounter, 15 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 3067 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 3067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:13,926 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 515 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 3067 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time]
[2025-04-28 21:22:13,927 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 279 states.
[2025-04-28 21:22:14,182 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 250.
[2025-04-28 21:22:14,183 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 250 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 38 states have internal predecessors, (41), 227 states have call successors, (227), 6 states have call predecessors, (227), 8 states have return successors, (659), 205 states have call predecessors, (659), 227 states have call successors, (659)
[2025-04-28 21:22:14,214 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 927 transitions.
[2025-04-28 21:22:14,214 INFO  L79                 Accepts]: Start accepts. Automaton has 250 states and 927 transitions. Word has length 80
[2025-04-28 21:22:14,215 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:14,215 INFO  L485      AbstractCegarLoop]: Abstraction has 250 states and 927 transitions.
[2025-04-28 21:22:14,215 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 12 states have internal predecessors, (19), 10 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 10 states have call successors, (34)
[2025-04-28 21:22:14,215 INFO  L278                IsEmpty]: Start isEmpty. Operand 250 states and 927 transitions.
[2025-04-28 21:22:14,231 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2025-04-28 21:22:14,232 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:14,232 INFO  L218           NwaCegarLoop]: trace histogram [10, 9, 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:22:14,239 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-04-28 21:22:14,436 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:14,437 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:14,438 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:14,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 2028650983, now seen corresponding path program 1 times
[2025-04-28 21:22:14,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:14,438 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577706508]
[2025-04-28 21:22:14,439 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:14,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:14,449 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes.
[2025-04-28 21:22:14,461 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements.
[2025-04-28 21:22:14,462 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:14,462 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:14,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 24 proven. 24 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked.
[2025-04-28 21:22:14,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:14,721 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577706508]
[2025-04-28 21:22:14,721 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577706508] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:14,721 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483332930]
[2025-04-28 21:22:14,721 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:14,721 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:14,724 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:14,726 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:22:14,729 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:22:14,805 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes.
[2025-04-28 21:22:14,879 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements.
[2025-04-28 21:22:14,879 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:14,880 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:14,882 INFO  L256         TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:14,884 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:15,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 43 proven. 26 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2025-04-28 21:22:15,028 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:15,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked.
[2025-04-28 21:22:15,559 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [483332930] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:15,560 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:15,560 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16
[2025-04-28 21:22:15,560 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937134994]
[2025-04-28 21:22:15,560 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:15,560 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-04-28 21:22:15,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:15,561 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-04-28 21:22:15,561 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:22:15,561 INFO  L87              Difference]: Start difference. First operand 250 states and 927 transitions. Second operand  has 16 states, 8 states have (on average 2.875) internal successors, (23), 14 states have internal predecessors, (23), 11 states have call successors, (24), 2 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 11 states have call successors, (24)
