/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dec-subseq-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:06,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:06,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:23:06,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:06,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:06,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:06,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:06,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:06,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:06,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:06,289 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:06,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:06,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:06,290 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:06,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:06,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:06,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:06,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:06,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:06,290 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:06,290 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:06,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:06,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:06,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:06,510 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:06,511 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:06,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dec-subseq-array.wvr.bpl [2025-04-26 16:23:06,514 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dec-subseq-array.wvr.bpl' [2025-04-26 16:23:06,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:06,533 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:06,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:06,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:06,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:06,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/1) ... [2025-04-26 16:23:06,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/1) ... [2025-04-26 16:23:06,572 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:06,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:06,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:06,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:06,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:06,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/1) ... [2025-04-26 16:23:06,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/1) ... [2025-04-26 16:23:06,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/1) ... [2025-04-26 16:23:06,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/1) ... [2025-04-26 16:23:06,585 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/1) ... [2025-04-26 16:23:06,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/1) ... [2025-04-26 16:23:06,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/1) ... [2025-04-26 16:23:06,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/1) ... [2025-04-26 16:23:06,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/1) ... [2025-04-26 16:23:06,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:06,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:06,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:06,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:06,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/1) ... [2025-04-26 16:23:06,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:06,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:06,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:06,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:23:06,654 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:06,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:06,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:06,655 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:06,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:06,655 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:06,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:06,655 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:23:06,694 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:06,695 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:06,779 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:06,779 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:06,796 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:06,796 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:06,797 INFO L201 PluginConnector]: Adding new model dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:06 BoogieIcfgContainer [2025-04-26 16:23:06,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:06,797 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:06,797 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:06,804 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:06,804 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:06,804 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:06" (1/2) ... [2025-04-26 16:23:06,806 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35e5558 and model type dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:06, skipping insertion in model container [2025-04-26 16:23:06,806 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:06,806 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:06" (2/2) ... [2025-04-26 16:23:06,809 INFO L376 chiAutomizerObserver]: Analyzing ICFG dec-subseq-array.wvr.bpl [2025-04-26 16:23:06,858 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:23:06,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2025-04-26 16:23:06,919 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 16:23:06,920 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:23:06,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 16:23:06,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 74 flow [2025-04-26 16:23:06,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2025-04-26 16:23:06,930 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 26 transitions, 64 flow [2025-04-26 16:23:06,939 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:06,939 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:06,939 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:06,939 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:06,939 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:06,939 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:06,939 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:06,939 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:06,941 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:06,974 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 47 [2025-04-26 16:23:06,974 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:06,974 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:06,978 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:06,978 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:06,978 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:06,978 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 64 states, but on-demand construction may add more states [2025-04-26 16:23:06,982 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 47 [2025-04-26 16:23:06,982 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:06,982 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:06,982 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:06,982 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:06,989 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-04-26 16:23:06,989 INFO L754 eck$LassoCheckResult]: Loop: "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[72] L24-->L24-2: Formula: (< v_last_3 (select v_A_4 v_i_5)) InVars {A=v_A_4, last=v_last_3, i=v_i_5} OutVars{A=v_A_4, last=v_last_3, i=v_i_5} AuxVars[] AssignedVars[]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" [2025-04-26 16:23:06,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash 88116564, now seen corresponding path program 1 times [2025-04-26 16:23:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:06,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424212560] [2025-04-26 16:23:06,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:07,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:07,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:07,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:07,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:07,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:07,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:07,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:07,065 INFO L85 PathProgramCache]: Analyzing trace with hash 98406, now seen corresponding path program 1 times [2025-04-26 16:23:07,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:07,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263062309] [2025-04-26 16:23:07,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:07,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:07,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:07,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:07,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,073 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:07,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:07,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:07,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:07,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:07,080 INFO L85 PathProgramCache]: Analyzing trace with hash 855608883, now seen corresponding path program 1 times [2025-04-26 16:23:07,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:07,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126134576] [2025-04-26 16:23:07,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:07,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:07,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:07,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:07,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:07,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:07,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126134576] [2025-04-26 16:23:07,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126134576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:07,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:07,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:23:07,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439158170] [2025-04-26 16:23:07,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:07,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:07,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:23:07,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:23:07,271 INFO L87 Difference]: Start difference. First operand currently 64 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:07,379 INFO L93 Difference]: Finished difference Result 186 states and 372 transitions. [2025-04-26 16:23:07,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 372 transitions. [2025-04-26 16:23:07,386 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 127 [2025-04-26 16:23:07,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 159 states and 327 transitions. [2025-04-26 16:23:07,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2025-04-26 16:23:07,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2025-04-26 16:23:07,400 INFO L74 IsDeterministic]: Start isDeterministic. Operand 159 states and 327 transitions. [2025-04-26 16:23:07,402 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:07,402 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 327 transitions. [2025-04-26 16:23:07,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 327 transitions. [2025-04-26 16:23:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 68. [2025-04-26 16:23:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.1029411764705883) internal successors, (in total 143), 67 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 143 transitions. [2025-04-26 16:23:07,437 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 143 transitions. [2025-04-26 16:23:07,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:23:07,440 INFO L438 stractBuchiCegarLoop]: Abstraction has 68 states and 143 transitions. [2025-04-26 16:23:07,441 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:07,441 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 143 transitions. [2025-04-26 16:23:07,446 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 55 [2025-04-26 16:23:07,446 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:07,446 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:07,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:07,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:07,447 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:07,448 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (or (not v_ok_2) (< v_v_old_1 v_new_2)) (not v_ok_1)) (and (<= v_new_2 v_v_old_1) v_ok_2 v_ok_1)) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 16:23:07,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1563353728, now seen corresponding path program 1 times [2025-04-26 16:23:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:07,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602858469] [2025-04-26 16:23:07,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:07,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:07,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:07,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:07,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:07,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:07,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:07,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 1 times [2025-04-26 16:23:07,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:07,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959215625] [2025-04-26 16:23:07,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:07,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:07,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:07,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,484 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:07,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:07,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:07,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:07,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1915392163, now seen corresponding path program 1 times [2025-04-26 16:23:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:07,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829786836] [2025-04-26 16:23:07,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:07,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:07,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:07,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:07,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:07,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829786836] [2025-04-26 16:23:07,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829786836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:07,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:07,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:23:07,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142474742] [2025-04-26 16:23:07,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:07,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:07,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:07,671 INFO L87 Difference]: Start difference. First operand 68 states and 143 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:07,693 INFO L93 Difference]: Finished difference Result 77 states and 150 transitions. [2025-04-26 16:23:07,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 150 transitions. [2025-04-26 16:23:07,695 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 47 [2025-04-26 16:23:07,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 69 states and 137 transitions. [2025-04-26 16:23:07,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-04-26 16:23:07,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-04-26 16:23:07,696 INFO L74 IsDeterministic]: Start isDeterministic. Operand 69 states and 137 transitions. [2025-04-26 16:23:07,696 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:07,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 137 transitions. [2025-04-26 16:23:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 137 transitions. [2025-04-26 16:23:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-04-26 16:23:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.0) internal successors, (in total 134), 66 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 134 transitions. [2025-04-26 16:23:07,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 134 transitions. [2025-04-26 16:23:07,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:07,700 INFO L438 stractBuchiCegarLoop]: Abstraction has 67 states and 134 transitions. [2025-04-26 16:23:07,700 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:07,700 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 134 transitions. [2025-04-26 16:23:07,701 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 47 [2025-04-26 16:23:07,701 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:07,701 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:07,701 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:07,701 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:07,702 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" [2025-04-26 16:23:07,702 INFO L754 eck$LassoCheckResult]: Loop: "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" [2025-04-26 16:23:07,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:07,702 INFO L85 PathProgramCache]: Analyzing trace with hash 855608851, now seen corresponding path program 1 times [2025-04-26 16:23:07,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:07,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708634704] [2025-04-26 16:23:07,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:07,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:07,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:07,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:07,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:07,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:07,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:07,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:07,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash 100166343, now seen corresponding path program 1 times [2025-04-26 16:23:07,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:07,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615538872] [2025-04-26 16:23:07,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:07,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:07,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:07,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:07,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:07,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:07,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:07,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:07,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1228462069, now seen corresponding path program 1 times [2025-04-26 16:23:07,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:07,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260839980] [2025-04-26 16:23:07,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:07,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:07,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:07,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:07,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,747 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:07,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:07,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:07,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:07,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:07,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:07,867 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:07,868 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:07,868 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:07,868 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:07,868 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:07,868 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:07,868 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:07,868 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:07,868 INFO L132 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:23:07,868 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:07,868 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:07,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:07,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:07,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,021 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:08,023 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:08,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,027 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:23:08,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,052 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:08,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:23:08,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:23:08,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,084 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:08,103 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:08,103 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:08,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,108 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:23:08,110 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:08,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:08,132 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:08,132 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:08,133 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:23:08,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:23:08,142 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:08,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:08,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:08,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:08,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:08,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:08,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:08,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:08,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:08,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:08,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:08,242 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:23:08,243 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 134 transitions. cyclomatic complexity: 74 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:08,312 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 134 transitions. cyclomatic complexity: 74. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 152 states and 345 transitions. Complement of second has 6 states. [2025-04-26 16:23:08,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-26 16:23:08,317 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 8 letters. Loop has 5 letters. [2025-04-26 16:23:08,318 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:08,318 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 13 letters. Loop has 5 letters. [2025-04-26 16:23:08,318 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:08,318 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 8 letters. Loop has 10 letters. [2025-04-26 16:23:08,318 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:08,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 345 transitions. [2025-04-26 16:23:08,321 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:08,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 100 states and 225 transitions. [2025-04-26 16:23:08,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-04-26 16:23:08,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2025-04-26 16:23:08,323 INFO L74 IsDeterministic]: Start isDeterministic. Operand 100 states and 225 transitions. [2025-04-26 16:23:08,323 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:08,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 225 transitions. [2025-04-26 16:23:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 225 transitions. [2025-04-26 16:23:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2025-04-26 16:23:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 2.25) internal successors, (in total 189), 83 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 189 transitions. [2025-04-26 16:23:08,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 189 transitions. [2025-04-26 16:23:08,328 INFO L438 stractBuchiCegarLoop]: Abstraction has 84 states and 189 transitions. [2025-04-26 16:23:08,328 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:08,328 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 189 transitions. [2025-04-26 16:23:08,329 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:08,329 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:08,329 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:08,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:08,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:08,330 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:08,330 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (or (not v_ok_2) (< v_v_old_1 v_new_2)) (not v_ok_1)) (and (<= v_new_2 v_v_old_1) v_ok_2 v_ok_1)) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 16:23:08,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,330 INFO L85 PathProgramCache]: Analyzing trace with hash 754070689, now seen corresponding path program 1 times [2025-04-26 16:23:08,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:08,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479508879] [2025-04-26 16:23:08,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:08,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:08,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:08,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:08,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:08,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:08,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:08,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:08,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,340 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 2 times [2025-04-26 16:23:08,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:08,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896979783] [2025-04-26 16:23:08,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:08,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:08,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:08,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:08,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:08,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:08,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:08,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:08,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:08,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1236873028, now seen corresponding path program 1 times [2025-04-26 16:23:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:08,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229480537] [2025-04-26 16:23:08,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:08,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:08,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:08,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:08,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:08,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:08,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:08,543 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:08,543 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:08,543 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:08,543 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:08,543 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:08,543 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,543 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:08,543 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:08,543 INFO L132 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:23:08,543 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:08,543 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:08,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,763 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:08,763 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:08,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:23:08,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,788 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:08,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:08,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,796 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:23:08,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,814 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:08,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:08,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,823 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:23:08,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,839 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:08,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:23:08,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,847 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:23:08,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,864 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:08,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:23:08,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,872 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:23:08,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,886 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:08,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,912 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:23:08,912 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:23:08,942 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:08,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:08,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,950 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:23:08,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,968 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:08,976 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:08,976 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:08,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,978 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:23:08,979 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:08,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:23:08,996 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:08,996 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:08,996 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2025-04-26 16:23:09,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:23:09,002 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:09,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:09,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:09,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:09,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:09,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:09,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:09,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:09,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:09,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:09,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:09,051 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:09,052 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 189 transitions. cyclomatic complexity: 115 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,076 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 189 transitions. cyclomatic complexity: 115. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 264 states and 609 transitions. Complement of second has 5 states. [2025-04-26 16:23:09,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-26 16:23:09,079 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:23:09,079 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:09,079 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:23:09,079 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:09,079 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 9 letters. Loop has 8 letters. [2025-04-26 16:23:09,079 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:09,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 264 states and 609 transitions. [2025-04-26 16:23:09,083 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:09,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 264 states to 173 states and 401 transitions. [2025-04-26 16:23:09,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-04-26 16:23:09,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2025-04-26 16:23:09,087 INFO L74 IsDeterministic]: Start isDeterministic. Operand 173 states and 401 transitions. [2025-04-26 16:23:09,087 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:09,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 401 transitions. [2025-04-26 16:23:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 401 transitions. [2025-04-26 16:23:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2025-04-26 16:23:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 161 states have (on average 2.3664596273291925) internal successors, (in total 381), 160 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 381 transitions. [2025-04-26 16:23:09,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 161 states and 381 transitions. [2025-04-26 16:23:09,099 INFO L438 stractBuchiCegarLoop]: Abstraction has 161 states and 381 transitions. [2025-04-26 16:23:09,099 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:23:09,099 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 381 transitions. [2025-04-26 16:23:09,102 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:09,102 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:09,102 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:09,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:09,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:09,103 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" [2025-04-26 16:23:09,104 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (or (not v_ok_2) (< v_v_old_1 v_new_2)) (not v_ok_1)) (and (<= v_new_2 v_v_old_1) v_ok_2 v_ok_1)) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 16:23:09,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1915145924, now seen corresponding path program 1 times [2025-04-26 16:23:09,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041298975] [2025-04-26 16:23:09,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:09,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:09,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:09,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,112 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:09,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:09,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,117 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 3 times [2025-04-26 16:23:09,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424139207] [2025-04-26 16:23:09,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:09,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:09,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:09,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:09,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:09,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:09,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1358823399, now seen corresponding path program 1 times [2025-04-26 16:23:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606577296] [2025-04-26 16:23:09,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:09,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:09,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:09,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:09,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,293 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:09,293 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:09,293 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:09,294 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:09,294 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:09,294 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,294 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:09,294 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:09,294 INFO L132 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:23:09,294 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:09,294 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:09,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,482 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:09,482 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:09,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,484 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:23:09,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,499 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:09,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:23:09,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,507 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:23:09,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,522 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:09,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:23:09,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,529 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:23:09,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,547 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:09,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:23:09,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,555 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:23:09,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,574 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:09,581 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:23:09,581 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:09,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,583 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:23:09,586 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:09,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:09,602 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:09,602 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:09,602 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(start, end) = -1*start + 1*end Supporting invariants [] [2025-04-26 16:23:09,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:09,609 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:09,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:09,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:09,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:09,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:09,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:09,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:09,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:09,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:09,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:09,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:09,665 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:09,666 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 161 states and 381 transitions. cyclomatic complexity: 239 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,698 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 161 states and 381 transitions. cyclomatic complexity: 239. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 484 states and 1154 transitions. Complement of second has 5 states. [2025-04-26 16:23:09,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-26 16:23:09,700 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:23:09,700 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:09,700 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:23:09,701 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:09,701 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 16:23:09,701 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:09,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 484 states and 1154 transitions. [2025-04-26 16:23:09,708 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:23:09,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 484 states to 350 states and 812 transitions. [2025-04-26 16:23:09,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2025-04-26 16:23:09,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-04-26 16:23:09,713 INFO L74 IsDeterministic]: Start isDeterministic. Operand 350 states and 812 transitions. [2025-04-26 16:23:09,713 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:09,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 350 states and 812 transitions. [2025-04-26 16:23:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 812 transitions. [2025-04-26 16:23:09,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 182. [2025-04-26 16:23:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 182 states have (on average 2.32967032967033) internal successors, (in total 424), 181 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 424 transitions. [2025-04-26 16:23:09,726 INFO L240 hiAutomatonCegarLoop]: Abstraction has 182 states and 424 transitions. [2025-04-26 16:23:09,726 INFO L438 stractBuchiCegarLoop]: Abstraction has 182 states and 424 transitions. [2025-04-26 16:23:09,726 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:23:09,726 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 424 transitions. [2025-04-26 16:23:09,729 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:23:09,729 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:09,729 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:09,730 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:09,730 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:09,730 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:09,730 INFO L754 eck$LassoCheckResult]: Loop: "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (or (not v_ok_2) (< v_v_old_1 v_new_2)) (not v_ok_1)) (and (<= v_new_2 v_v_old_1) v_ok_2 v_ok_1)) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:09,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1915145926, now seen corresponding path program 1 times [2025-04-26 16:23:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669420576] [2025-04-26 16:23:09,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:09,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:09,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:09,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,739 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:09,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:09,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,746 INFO L85 PathProgramCache]: Analyzing trace with hash 3356478, now seen corresponding path program 4 times [2025-04-26 16:23:09,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224907415] [2025-04-26 16:23:09,746 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:09,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,748 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-04-26 16:23:09,750 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:09,750 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:09,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:09,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:09,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1360731011, now seen corresponding path program 2 times [2025-04-26 16:23:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926927746] [2025-04-26 16:23:09,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:09,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-26 16:23:09,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:09,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:09,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:09,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:09,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,932 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:09,932 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:09,932 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:09,932 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:09,932 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:09,932 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,932 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:09,932 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:09,932 INFO L132 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:23:09,932 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:09,932 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:09,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,166 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:10,166 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:10,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,168 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:23:10,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,183 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:23:10,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,193 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:23:10,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,210 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:10,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,221 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:23:10,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,238 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:10,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,247 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:23:10,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,260 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:10,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,270 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:23:10,270 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:10,286 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:10,306 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:23:10,306 INFO L437 ModelExtractionUtils]: 14 out of 26 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:23:10,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,309 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:23:10,311 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:10,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:23:10,330 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:23:10,330 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:10,330 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(start, end) = -1*start + 1*end Supporting invariants [] [2025-04-26 16:23:10,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:23:10,338 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:10,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:10,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:10,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:10,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:10,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:10,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:10,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:10,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:10,393 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:10,393 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 182 states and 424 transitions. cyclomatic complexity: 265 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,419 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 182 states and 424 transitions. cyclomatic complexity: 265. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 573 states and 1311 transitions. Complement of second has 5 states. [2025-04-26 16:23:10,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-26 16:23:10,424 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:23:10,424 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,424 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:23:10,424 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,424 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 16:23:10,424 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 573 states and 1311 transitions. [2025-04-26 16:23:10,431 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:23:10,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 573 states to 404 states and 918 transitions. [2025-04-26 16:23:10,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-04-26 16:23:10,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2025-04-26 16:23:10,435 INFO L74 IsDeterministic]: Start isDeterministic. Operand 404 states and 918 transitions. [2025-04-26 16:23:10,435 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:10,435 INFO L218 hiAutomatonCegarLoop]: Abstraction has 404 states and 918 transitions. [2025-04-26 16:23:10,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states and 918 transitions. [2025-04-26 16:23:10,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 204. [2025-04-26 16:23:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 204 states have (on average 2.343137254901961) internal successors, (in total 478), 203 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 478 transitions. [2025-04-26 16:23:10,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 204 states and 478 transitions. [2025-04-26 16:23:10,450 INFO L438 stractBuchiCegarLoop]: Abstraction has 204 states and 478 transitions. [2025-04-26 16:23:10,450 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:23:10,450 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 478 transitions. [2025-04-26 16:23:10,454 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:23:10,454 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:10,454 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:10,454 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:10,454 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:10,454 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" [2025-04-26 16:23:10,455 INFO L754 eck$LassoCheckResult]: Loop: "[80] L40-1-->L46: Formula: (or (and (or (not v_ok_2) (< v_v_old_1 v_new_2)) (not v_ok_1)) (and (<= v_new_2 v_v_old_1) v_ok_2 v_ok_1)) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" [2025-04-26 16:23:10,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,455 INFO L85 PathProgramCache]: Analyzing trace with hash -760014639, now seen corresponding path program 1 times [2025-04-26 16:23:10,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:10,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938605166] [2025-04-26 16:23:10,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:10,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:10,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:10,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:10,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:10,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:10,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:10,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:10,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash 3387108, now seen corresponding path program 5 times [2025-04-26 16:23:10,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:10,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128653127] [2025-04-26 16:23:10,468 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:10,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:10,470 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:10,471 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:10,472 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:10,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,472 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:10,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:10,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:10,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:10,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1626480716, now seen corresponding path program 3 times [2025-04-26 16:23:10,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:10,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648063149] [2025-04-26 16:23:10,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:10,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:10,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-26 16:23:10,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:10,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:23:10,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:10,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:10,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648063149] [2025-04-26 16:23:10,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648063149] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:10,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:10,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:23:10,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116772718] [2025-04-26 16:23:10,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:10,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:10,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:23:10,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:23:10,600 INFO L87 Difference]: Start difference. First operand 204 states and 478 transitions. cyclomatic complexity: 299 Second operand has 5 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:10,631 INFO L93 Difference]: Finished difference Result 423 states and 956 transitions. [2025-04-26 16:23:10,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 956 transitions. [2025-04-26 16:23:10,635 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:10,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 309 states and 704 transitions. [2025-04-26 16:23:10,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2025-04-26 16:23:10,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2025-04-26 16:23:10,638 INFO L74 IsDeterministic]: Start isDeterministic. Operand 309 states and 704 transitions. [2025-04-26 16:23:10,638 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:10,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 309 states and 704 transitions. [2025-04-26 16:23:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 704 transitions. [2025-04-26 16:23:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 249. [2025-04-26 16:23:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 249 states have (on average 2.3453815261044175) internal successors, (in total 584), 248 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 584 transitions. [2025-04-26 16:23:10,650 INFO L240 hiAutomatonCegarLoop]: Abstraction has 249 states and 584 transitions. [2025-04-26 16:23:10,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:23:10,651 INFO L438 stractBuchiCegarLoop]: Abstraction has 249 states and 584 transitions. [2025-04-26 16:23:10,651 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:23:10,651 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 584 transitions. [2025-04-26 16:23:10,652 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:10,652 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:10,652 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:10,653 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:10,653 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:10,653 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" [2025-04-26 16:23:10,653 INFO L754 eck$LassoCheckResult]: Loop: "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (or (not v_ok_2) (< v_v_old_1 v_new_2)) (not v_ok_1)) (and (<= v_new_2 v_v_old_1) v_ok_2 v_ok_1)) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:10,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash -829224764, now seen corresponding path program 1 times [2025-04-26 16:23:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:10,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027816906] [2025-04-26 16:23:10,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:10,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:10,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:10,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:10,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,662 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:10,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:10,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:10,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:10,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash 3356478, now seen corresponding path program 6 times [2025-04-26 16:23:10,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:10,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001329754] [2025-04-26 16:23:10,674 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:10,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:10,676 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:10,678 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:10,678 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:23:10,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:10,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:10,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:10,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:10,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash -927062399, now seen corresponding path program 1 times [2025-04-26 16:23:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:10,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509669868] [2025-04-26 16:23:10,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:10,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:10,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:10,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:10,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:10,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:10,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:10,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:10,879 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:10,879 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:10,879 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:10,879 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:10,879 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:10,879 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,879 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:10,879 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:10,879 INFO L132 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:23:10,879 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:10,879 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:10,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,143 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:11,143 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:11,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,145 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:23:11,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:11,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:11,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:11,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:11,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:11,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:11,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:11,161 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:11,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:23:11,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,169 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:23:11,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:11,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:11,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:11,181 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:11,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:11,187 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:23:11,187 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:11,202 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:11,216 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:11,216 INFO L437 ModelExtractionUtils]: 13 out of 26 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 16:23:11,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,218 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:23:11,220 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:11,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:23:11,236 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:23:11,236 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:11,236 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2025-04-26 16:23:11,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:11,244 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:11,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:11,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:11,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:11,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:11,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:11,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:11,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:11,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:11,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:11,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:11,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:11,292 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:11,292 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:11,315 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 403 states and 908 transitions. Complement of second has 5 states. [2025-04-26 16:23:11,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-26 16:23:11,317 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:23:11,317 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:11,317 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:11,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:11,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:11,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:11,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:11,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:11,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:11,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:11,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:11,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:11,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:11,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:11,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:11,383 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:11,383 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:11,412 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 483 states and 1086 transitions. Complement of second has 7 states. [2025-04-26 16:23:11,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-04-26 16:23:11,414 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:23:11,414 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:11,414 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:11,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:11,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:11,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:11,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:11,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:11,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:11,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:11,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:11,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:11,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:11,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:11,466 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:11,466 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:11,487 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 588 states and 1370 transitions. Complement of second has 5 states. [2025-04-26 16:23:11,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-26 16:23:11,488 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:23:11,488 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:11,488 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:23:11,488 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:11,488 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 15 letters. Loop has 8 letters. [2025-04-26 16:23:11,488 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:11,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 588 states and 1370 transitions. [2025-04-26 16:23:11,492 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:11,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 588 states to 0 states and 0 transitions. [2025-04-26 16:23:11,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:11,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:11,492 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:11,492 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:11,492 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:11,492 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:11,492 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:11,492 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:23:11,492 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:11,492 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:11,493 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:11,497 INFO L201 PluginConnector]: Adding new model dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:11 BoogieIcfgContainer [2025-04-26 16:23:11,497 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:11,498 INFO L158 Benchmark]: Toolchain (without parser) took 4965.07ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 75.6MB in the beginning and 197.0MB in the end (delta: -121.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:11,498 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.64ms. Allocated memory is still 142.6MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:11,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.64ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 73.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:11,498 INFO L158 Benchmark]: Boogie Preprocessor took 27.15ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 72.8MB in the end (delta: 807.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:11,501 INFO L158 Benchmark]: RCFGBuilder took 195.44ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 62.7MB in the end (delta: 9.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:23:11,501 INFO L158 Benchmark]: BuchiAutomizer took 4700.20ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 62.5MB in the beginning and 197.0MB in the end (delta: -134.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:11,502 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.64ms. Allocated memory is still 142.6MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.64ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 73.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.15ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 72.8MB in the end (delta: 807.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 195.44ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 62.7MB in the end (delta: 9.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4700.20ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 62.5MB in the beginning and 197.0MB in the end (delta: -134.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 549 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 175 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp96 ukn80 mio100 lsp58 div100 bol117 ite100 ukn100 eq163 hnf90 smp100 dnf199 smp67 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 71ms VariablesStem: 6 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One nondeterministic module has affine ranking function end + -1 * start and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:11,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...