/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/parallel/min-max-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:39,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:39,296 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:22:39,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:39,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:39,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:39,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:39,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:39,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:39,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:39,324 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:39,324 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:39,324 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:39,324 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:39,325 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:39,325 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:39,325 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:39,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:39,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:39,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:39,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:39,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:39,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:39,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:39,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:39,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:39,327 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:39,327 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:39,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:39,327 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:39,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:39,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:39,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:39,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:39,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:39,328 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:39,328 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:39,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:39,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:39,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:39,564 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:39,564 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:39,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl [2025-04-26 16:22:39,565 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl' [2025-04-26 16:22:39,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:39,585 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:39,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:39,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:39,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:39,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/1) ... [2025-04-26 16:22:39,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/1) ... [2025-04-26 16:22:39,622 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:39,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:39,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:39,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:39,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:39,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/1) ... [2025-04-26 16:22:39,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/1) ... [2025-04-26 16:22:39,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/1) ... [2025-04-26 16:22:39,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/1) ... [2025-04-26 16:22:39,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/1) ... [2025-04-26 16:22:39,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/1) ... [2025-04-26 16:22:39,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/1) ... [2025-04-26 16:22:39,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/1) ... [2025-04-26 16:22:39,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/1) ... [2025-04-26 16:22:39,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:39,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:39,642 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:39,642 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:39,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/1) ... [2025-04-26 16:22:39,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:39,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:39,674 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:22:39,677 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:22:39,698 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:39,698 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:39,698 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:39,698 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:39,698 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:39,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:39,699 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:39,699 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:39,699 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:22:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:22:39,699 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:22:39,699 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:22:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:22:39,699 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:22:39,700 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:22:39,741 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:39,743 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:39,862 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:39,862 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:39,873 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:39,873 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:22:39,874 INFO L201 PluginConnector]: Adding new model min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:39 BoogieIcfgContainer [2025-04-26 16:22:39,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:39,875 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:39,876 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:39,880 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:39,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:39,880 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:39" (1/2) ... [2025-04-26 16:22:39,882 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d49f47e and model type min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:39, skipping insertion in model container [2025-04-26 16:22:39,882 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:39,882 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:39" (2/2) ... [2025-04-26 16:22:39,883 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-2.wvr.bpl [2025-04-26 16:22:39,953 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:22:39,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 51 transitions, 137 flow [2025-04-26 16:22:40,018 INFO L116 PetriNetUnfolderBase]: 4/41 cut-off events. [2025-04-26 16:22:40,020 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:22:40,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 41 events. 4/41 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 110 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-04-26 16:22:40,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 51 transitions, 137 flow [2025-04-26 16:22:40,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 41 transitions, 112 flow [2025-04-26 16:22:40,026 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 53 places, 41 transitions, 112 flow [2025-04-26 16:22:40,035 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:40,035 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:40,035 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:40,035 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:40,035 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:40,035 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:40,035 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:40,035 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:40,037 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:40,687 INFO L131 ngComponentsAnalysis]: Automaton has 802 accepting balls. 5442 [2025-04-26 16:22:40,687 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:40,687 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:40,692 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:40,692 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:22:40,692 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:40,692 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 5825 states, but on-demand construction may add more states [2025-04-26 16:22:40,792 INFO L131 ngComponentsAnalysis]: Automaton has 802 accepting balls. 5442 [2025-04-26 16:22:40,792 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:40,793 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:40,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:40,794 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:22:40,798 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_v_assert_2))) (and (or (and v_b1_2 v_v_assert_2) (and (not v_b1_2) .cse0)) (= v_i_6 v_k_1) (= v_i_6 0) (or (and v_b2_2 v_v_assert_2) (and .cse0 (not v_b2_2))) (= v_j_6 v_i_6) (= v_i_6 v_l_1) .cse0)) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} AuxVars[] AssignedVars[]" "[124] L71-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[96] $Ultimate##0-->L25: Formula: (= (select v_A_1 0) v_min_1) InVars {A=v_A_1} OutVars{A=v_A_1, min=v_min_1} AuxVars[] AssignedVars[min]" "[97] L25-->L26-1: Formula: v_b1_1 InVars {} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[b1]" [2025-04-26 16:22:40,801 INFO L754 eck$LassoCheckResult]: Loop: "[99] L26-1-->L27: 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[]" "[101] L27-->L28: Formula: (= v_min_2 (let ((.cse0 (select v_A_2 v_i_2))) (ite (< v_min_3 .cse0) v_min_3 .cse0))) InVars {A=v_A_2, i=v_i_2, min=v_min_3} OutVars{A=v_A_2, i=v_i_2, min=v_min_2} AuxVars[] AssignedVars[min]" "[102] L28-->L26-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 16:22:40,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:40,805 INFO L85 PathProgramCache]: Analyzing trace with hash 3637575, now seen corresponding path program 1 times [2025-04-26 16:22:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:40,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446345560] [2025-04-26 16:22:40,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:40,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:40,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:40,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:40,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:40,864 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:40,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:40,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:40,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:40,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:40,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:40,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash 128163, now seen corresponding path program 1 times [2025-04-26 16:22:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:40,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901536727] [2025-04-26 16:22:40,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:40,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:40,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:40,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:40,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:40,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:40,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:40,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:40,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:40,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:40,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:40,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:40,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:40,911 INFO L85 PathProgramCache]: Analyzing trace with hash 992912797, now seen corresponding path program 1 times [2025-04-26 16:22:40,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:40,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131163879] [2025-04-26 16:22:40,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:40,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:40,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:22:40,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:22:40,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:40,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:40,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:40,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:22:40,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:22:40,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:40,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:40,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:41,153 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:41,153 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:41,153 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:41,154 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:41,154 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:41,154 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,154 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:41,154 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:41,154 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-2.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:41,154 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:41,155 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:41,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:41,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:41,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:41,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:41,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:41,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:41,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:41,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:41,438 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:41,440 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:41,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,443 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:22:41,444 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:22:41,445 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:22:41,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:41,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:41,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:41,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:41,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:41,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:41,469 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:41,476 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:22:41,476 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:41,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,479 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:22:41,480 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:22:41,480 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:41,497 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:22:41,498 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:41,498 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:41,499 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:22:41,504 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:22:41,506 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:41,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:41,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:41,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:41,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:41,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:41,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:41,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:41,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:41,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:41,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:41,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:41,552 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:41,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:41,575 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:22:41,601 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:22:41,604 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 5825 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:22:42,003 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 5825 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 13871 states and 74777 transitions. Complement of second has 7 states. [2025-04-26 16:22:42,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:22:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-04-26 16:22:42,019 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:22:42,020 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:42,020 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:22:42,020 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:42,020 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:22:42,020 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:42,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13871 states and 74777 transitions. [2025-04-26 16:22:42,286 INFO L131 ngComponentsAnalysis]: Automaton has 973 accepting balls. 5211 [2025-04-26 16:22:42,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13871 states to 11234 states and 60713 transitions. [2025-04-26 16:22:42,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6259 [2025-04-26 16:22:42,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8391 [2025-04-26 16:22:42,604 INFO L74 IsDeterministic]: Start isDeterministic. Operand 11234 states and 60713 transitions. [2025-04-26 16:22:42,605 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:42,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11234 states and 60713 transitions. [2025-04-26 16:22:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11234 states and 60713 transitions. [2025-04-26 16:22:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11234 to 9105. [2025-04-26 16:22:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9105 states, 9105 states have (on average 5.492037342119715) internal successors, (in total 50005), 9104 states have internal predecessors, (50005), 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:22:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9105 states to 9105 states and 50005 transitions. [2025-04-26 16:22:43,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9105 states and 50005 transitions. [2025-04-26 16:22:43,081 INFO L438 stractBuchiCegarLoop]: Abstraction has 9105 states and 50005 transitions. [2025-04-26 16:22:43,081 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:43,081 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9105 states and 50005 transitions. [2025-04-26 16:22:43,182 INFO L131 ngComponentsAnalysis]: Automaton has 973 accepting balls. 5211 [2025-04-26 16:22:43,182 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:43,182 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:43,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:43,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:22:43,184 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_v_assert_2))) (and (or (and v_b1_2 v_v_assert_2) (and (not v_b1_2) .cse0)) (= v_i_6 v_k_1) (= v_i_6 0) (or (and v_b2_2 v_v_assert_2) (and .cse0 (not v_b2_2))) (= v_j_6 v_i_6) (= v_i_6 v_l_1) .cse0)) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} AuxVars[] AssignedVars[]" "[124] L71-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[127] L71-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[130] L72-->L46: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:22:43,184 INFO L754 eck$LassoCheckResult]: Loop: "[111] L46-->L47: Formula: (< v_k_2 v_N_5) InVars {k=v_k_2, N=v_N_5} OutVars{k=v_k_2, N=v_N_5} AuxVars[] AssignedVars[]" "[113] L47-->L48: Formula: (= (store v_A_6 v_k_3 (+ (select v_A_6 v_k_3) 1)) v_A_5) InVars {A=v_A_6, k=v_k_3} OutVars{A=v_A_5, k=v_k_3} AuxVars[] AssignedVars[A]" "[114] L48-->L46: Formula: (= v_k_4 (+ v_k_5 1)) InVars {k=v_k_5} OutVars{k=v_k_4} AuxVars[] AssignedVars[k]" [2025-04-26 16:22:43,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash 3638569, now seen corresponding path program 1 times [2025-04-26 16:22:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:43,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911831745] [2025-04-26 16:22:43,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:43,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:43,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:43,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:43,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:43,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:43,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:43,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,197 INFO L85 PathProgramCache]: Analyzing trace with hash 140079, now seen corresponding path program 1 times [2025-04-26 16:22:43,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:43,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591294437] [2025-04-26 16:22:43,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:43,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:43,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:43,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:43,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:43,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:43,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:43,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:43,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1022536967, now seen corresponding path program 1 times [2025-04-26 16:22:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:43,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016358850] [2025-04-26 16:22:43,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:43,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:22:43,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:22:43,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,217 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:43,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:22:43,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:22:43,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:43,350 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:43,350 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:43,350 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:43,350 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:43,350 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:43,350 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,350 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:43,350 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:43,350 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-2.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:43,350 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:43,350 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:43,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,483 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:43,484 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:43,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:43,486 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:22:43,490 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:22:43,491 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:22:43,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:43,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:43,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:43,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:43,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:43,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:43,507 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:43,514 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:22:43,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:43,516 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:22:43,517 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:22:43,519 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:22:43,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:43,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:43,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:43,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:43,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:43,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:43,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:43,542 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:22:43,543 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:43,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:43,545 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:22:43,546 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:22:43,548 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:43,566 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:22:43,566 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:43,566 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:43,566 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:22:43,573 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:22:43,573 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:43,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:43,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:43,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:43,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:43,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:43,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:43,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,609 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:43,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:43,636 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:22:43,636 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:22:43,636 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9105 states and 50005 transitions. cyclomatic complexity: 42042 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:22:44,331 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9105 states and 50005 transitions. cyclomatic complexity: 42042. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 30126 states and 176260 transitions. Complement of second has 6 states. [2025-04-26 16:22:44,331 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:22:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:22:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-04-26 16:22:44,332 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:22:44,332 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:44,332 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:22:44,332 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:44,332 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:22:44,332 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:44,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30126 states and 176260 transitions. [2025-04-26 16:22:45,156 INFO L131 ngComponentsAnalysis]: Automaton has 1145 accepting balls. 4365 [2025-04-26 16:22:45,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30126 states to 22709 states and 132505 transitions. [2025-04-26 16:22:45,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7169 [2025-04-26 16:22:45,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10224 [2025-04-26 16:22:45,497 INFO L74 IsDeterministic]: Start isDeterministic. Operand 22709 states and 132505 transitions. [2025-04-26 16:22:45,497 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:45,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22709 states and 132505 transitions. [2025-04-26 16:22:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22709 states and 132505 transitions. [2025-04-26 16:22:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22709 to 17825. [2025-04-26 16:22:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17825 states, 17825 states have (on average 5.849088359046283) internal successors, (in total 104260), 17824 states have internal predecessors, (104260), 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:22:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17825 states to 17825 states and 104260 transitions. [2025-04-26 16:22:46,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17825 states and 104260 transitions. [2025-04-26 16:22:46,308 INFO L438 stractBuchiCegarLoop]: Abstraction has 17825 states and 104260 transitions. [2025-04-26 16:22:46,308 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:46,308 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17825 states and 104260 transitions. [2025-04-26 16:22:46,426 INFO L131 ngComponentsAnalysis]: Automaton has 1145 accepting balls. 4365 [2025-04-26 16:22:46,426 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:46,426 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:46,427 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:46,427 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:22:46,428 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_v_assert_2))) (and (or (and v_b1_2 v_v_assert_2) (and (not v_b1_2) .cse0)) (= v_i_6 v_k_1) (= v_i_6 0) (or (and v_b2_2 v_v_assert_2) (and .cse0 (not v_b2_2))) (= v_j_6 v_i_6) (= v_i_6 v_l_1) .cse0)) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} AuxVars[] AssignedVars[]" "[124] L71-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[127] L71-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[130] L72-->L46: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[133] L73-->L55: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:22:46,428 INFO L754 eck$LassoCheckResult]: Loop: "[116] L55-->L56: Formula: (< v_l_6 v_N_8) InVars {l=v_l_6, N=v_N_8} OutVars{l=v_l_6, N=v_N_8} AuxVars[] AssignedVars[]" "[118] L56-->L57: Formula: (= (store v_A_8 v_l_2 (+ (- 1) (select v_A_8 v_l_2))) v_A_7) InVars {A=v_A_8, l=v_l_2} OutVars{A=v_A_7, l=v_l_2} AuxVars[] AssignedVars[A]" "[119] L57-->L55: Formula: (= (+ v_l_4 1) v_l_3) InVars {l=v_l_4} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" [2025-04-26 16:22:46,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash 112795772, now seen corresponding path program 1 times [2025-04-26 16:22:46,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914776738] [2025-04-26 16:22:46,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:46,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:46,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,435 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:46,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:46,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash 145044, now seen corresponding path program 1 times [2025-04-26 16:22:46,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001822173] [2025-04-26 16:22:46,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:46,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:46,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:46,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:46,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1634533433, now seen corresponding path program 1 times [2025-04-26 16:22:46,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589062399] [2025-04-26 16:22:46,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:46,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:46,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:46,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:46,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,646 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:46,646 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:46,646 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:46,646 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:46,646 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:46,646 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,646 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:46,646 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:46,646 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-2.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:22:46,646 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:46,646 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:46,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,828 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:46,828 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:46,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,830 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:22:46,832 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:22:46,834 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:22:46,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,852 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:46,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,862 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:22:46,864 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:22:46,865 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:22:46,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,884 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:46,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,894 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:22:46,897 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:22:46,897 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:22:46,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,917 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:22:46,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,928 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:22:46,932 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:22:46,933 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:22:46,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,954 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,962 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:22:46,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,964 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:22:46,966 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:22:46,967 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:22:46,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,983 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,990 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:22:46,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,992 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:22:47,052 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:22:47,053 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:22:47,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:47,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:47,068 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:47,081 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:22:47,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,087 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:22:47,092 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:22:47,097 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:22:47,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:47,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:47,112 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:47,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:47,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,120 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:22:47,121 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:22:47,126 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:22:47,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:47,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:47,155 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:47,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:47,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,163 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:22:47,164 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:22:47,166 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:22:47,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:47,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:47,180 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:47,186 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:22:47,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,189 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:22:47,190 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:22:47,191 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:22:47,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:47,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:47,216 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:47,223 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:22:47,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,227 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:22:47,240 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:22:47,240 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:22:47,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:47,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:47,259 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:47,266 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:22:47,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,268 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:22:47,270 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:22:47,272 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:22:47,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:47,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:47,304 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:47,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:22:47,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,323 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:22:47,328 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:22:47,328 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:22:47,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:47,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:47,349 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:47,358 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:22:47,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,363 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:22:47,365 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:22:47,368 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:22:47,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:47,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:47,397 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:47,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:47,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,415 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:22:47,416 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:22:47,420 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:22:47,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:47,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:47,446 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:47,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:47,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,464 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:22:47,465 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:22:47,466 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:22:47,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:47,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:47,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:47,486 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:47,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:47,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,497 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:22:47,497 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:22:47,500 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:22:47,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:47,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:47,518 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:47,524 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:22:47,525 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:47,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,527 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:22:47,530 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:22:47,530 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:47,547 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:22:47,547 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:47,547 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:47,547 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(l, N) = -1*l + 1*N Supporting invariants [] [2025-04-26 16:22:47,553 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:22:47,555 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:47,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:47,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:47,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:47,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:47,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:47,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:47,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:47,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:47,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:47,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:47,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:47,638 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:47,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:47,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:22:47,666 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:22:47,666 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17825 states and 104260 transitions. cyclomatic complexity: 88308 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:22:48,442 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17825 states and 104260 transitions. cyclomatic complexity: 88308. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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) Result 53699 states and 323330 transitions. Complement of second has 6 states. [2025-04-26 16:22:48,442 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:22:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:22:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-04-26 16:22:48,443 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:22:48,443 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:48,443 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:22:48,443 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:48,443 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:22:48,443 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:48,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53699 states and 323330 transitions. [2025-04-26 16:22:49,702 INFO L131 ngComponentsAnalysis]: Automaton has 817 accepting balls. 2451 [2025-04-26 16:22:50,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53699 states to 34140 states and 206064 transitions. [2025-04-26 16:22:50,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8465 [2025-04-26 16:22:50,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10788 [2025-04-26 16:22:50,349 INFO L74 IsDeterministic]: Start isDeterministic. Operand 34140 states and 206064 transitions. [2025-04-26 16:22:50,349 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:50,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34140 states and 206064 transitions. [2025-04-26 16:22:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34140 states and 206064 transitions. [2025-04-26 16:22:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34140 to 29269. [2025-04-26 16:22:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29269 states, 29269 states have (on average 6.10707574566948) internal successors, (in total 178748), 29268 states have internal predecessors, (178748), 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:22:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29269 states to 29269 states and 178748 transitions. [2025-04-26 16:22:51,547 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29269 states and 178748 transitions. [2025-04-26 16:22:51,547 INFO L438 stractBuchiCegarLoop]: Abstraction has 29269 states and 178748 transitions. [2025-04-26 16:22:51,547 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:22:51,547 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29269 states and 178748 transitions. [2025-04-26 16:22:51,879 INFO L131 ngComponentsAnalysis]: Automaton has 817 accepting balls. 2451 [2025-04-26 16:22:51,879 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:51,879 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:51,880 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:51,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:22:51,881 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_v_assert_2))) (and (or (and v_b1_2 v_v_assert_2) (and (not v_b1_2) .cse0)) (= v_i_6 v_k_1) (= v_i_6 0) (or (and v_b2_2 v_v_assert_2) (and .cse0 (not v_b2_2))) (= v_j_6 v_i_6) (= v_i_6 v_l_1) .cse0)) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} AuxVars[] AssignedVars[]" "[124] L71-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[127] L71-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[103] $Ultimate##0-->L36: Formula: (= (select v_A_4 0) v_max_3) InVars {A=v_A_4} OutVars{A=v_A_4, max=v_max_3} AuxVars[] AssignedVars[max]" "[104] L36-->L37-1: Formula: v_b2_1 InVars {} OutVars{b2=v_b2_1} AuxVars[] AssignedVars[b2]" [2025-04-26 16:22:51,881 INFO L754 eck$LassoCheckResult]: Loop: "[106] L37-1-->L38: Formula: (< v_j_1 v_N_3) InVars {N=v_N_3, j=v_j_1} OutVars{N=v_N_3, j=v_j_1} AuxVars[] AssignedVars[]" "[108] L38-->L39: Formula: (= v_max_1 (let ((.cse0 (select v_A_3 v_j_2))) (ite (< .cse0 v_max_2) v_max_2 .cse0))) InVars {A=v_A_3, max=v_max_2, j=v_j_2} OutVars{A=v_A_3, max=v_max_1, j=v_j_2} AuxVars[] AssignedVars[max]" "[109] L39-->L37-1: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" [2025-04-26 16:22:51,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:51,881 INFO L85 PathProgramCache]: Analyzing trace with hash 112794906, now seen corresponding path program 1 times [2025-04-26 16:22:51,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:51,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887460880] [2025-04-26 16:22:51,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:51,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:51,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:51,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:51,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:51,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:51,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:51,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:51,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:51,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:51,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:51,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:51,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:51,902 INFO L85 PathProgramCache]: Analyzing trace with hash 135114, now seen corresponding path program 1 times [2025-04-26 16:22:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:51,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152289865] [2025-04-26 16:22:51,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:51,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:51,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:51,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:51,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:51,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:51,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:51,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:51,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:51,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:51,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:51,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1608724497, now seen corresponding path program 1 times [2025-04-26 16:22:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:51,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393094276] [2025-04-26 16:22:51,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:51,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:51,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:51,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:51,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:51,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:51,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:51,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:51,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:51,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:51,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:51,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:52,138 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:52,138 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:52,138 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:52,138 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:52,138 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:52,138 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,138 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:52,138 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:52,138 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-2.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:22:52,138 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:52,138 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:52,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:52,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:52,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:52,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:52,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:52,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:52,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:52,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:52,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:52,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:52,381 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:52,381 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:52,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,386 INFO L229 MonitoredProcess]: Starting monitored process 25 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:22:52,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:22:52,389 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:22:52,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:52,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:52,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:52,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:52,412 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:52,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:52,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,421 INFO L229 MonitoredProcess]: Starting monitored process 26 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:22:52,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:22:52,424 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:22:52,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:52,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:52,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:52,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:52,445 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:52,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:52,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,454 INFO L229 MonitoredProcess]: Starting monitored process 27 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:22:52,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:22:52,457 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:22:52,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:52,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:52,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:52,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:52,472 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:52,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:22:52,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,480 INFO L229 MonitoredProcess]: Starting monitored process 28 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:22:52,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:22:52,482 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:22:52,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:52,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:52,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:52,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:52,502 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:52,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:22:52,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,512 INFO L229 MonitoredProcess]: Starting monitored process 29 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:22:52,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:22:52,515 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:22:52,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:52,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:52,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:52,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:52,535 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:52,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:22:52,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,549 INFO L229 MonitoredProcess]: Starting monitored process 30 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:22:52,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:22:52,555 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:22:52,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:52,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:52,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:52,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:52,582 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:52,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:52,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,593 INFO L229 MonitoredProcess]: Starting monitored process 31 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:22:52,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:22:52,599 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:22:52,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:52,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:52,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:52,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:52,621 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:52,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:52,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,637 INFO L229 MonitoredProcess]: Starting monitored process 32 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:22:52,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:22:52,640 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:22:52,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:52,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:52,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:52,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:52,664 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:52,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:52,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,672 INFO L229 MonitoredProcess]: Starting monitored process 33 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:22:52,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:22:52,674 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:22:52,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:52,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:52,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:52,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:52,700 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:52,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:52,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,711 INFO L229 MonitoredProcess]: Starting monitored process 34 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:22:52,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:22:52,719 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:22:52,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:52,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:52,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:52,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:52,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:52,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:52,742 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:52,762 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:22:52,763 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:52,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:52,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:52,765 INFO L229 MonitoredProcess]: Starting monitored process 35 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:22:52,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:22:52,768 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:52,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:52,785 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:52,785 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:52,785 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, N) = -1*j + 1*N Supporting invariants [] [2025-04-26 16:22:52,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:52,795 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:52,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:52,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:52,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:52,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:52,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:52,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:52,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:52,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:52,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:52,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:52,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:52,838 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:52,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:52,875 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:22:52,875 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:22:52,876 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29269 states and 178748 transitions. cyclomatic complexity: 151998 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:22:54,232 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29269 states and 178748 transitions. cyclomatic complexity: 151998. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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) Result 79805 states and 495556 transitions. Complement of second has 6 states. [2025-04-26 16:22:54,232 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:22:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:22:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-04-26 16:22:54,233 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:22:54,233 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:54,233 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:22:54,233 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:54,233 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:22:54,233 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:54,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79805 states and 495556 transitions. [2025-04-26 16:22:55,822 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:55,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79805 states to 0 states and 0 transitions. [2025-04-26 16:22:55,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:22:55,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:22:55,822 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:22:55,822 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:55,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:55,822 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:55,822 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:55,822 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:22:55,823 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:22:55,823 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:55,823 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:22:55,830 INFO L201 PluginConnector]: Adding new model min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:55 BoogieIcfgContainer [2025-04-26 16:22:55,830 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:55,831 INFO L158 Benchmark]: Toolchain (without parser) took 16245.37ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 86.7MB in the beginning and 1.0GB in the end (delta: -932.5MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-04-26 16:22:55,831 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:55,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.17ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:55,835 INFO L158 Benchmark]: Boogie Preprocessor took 18.38ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:55,835 INFO L158 Benchmark]: RCFGBuilder took 232.03ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 73.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:22:55,835 INFO L158 Benchmark]: BuchiAutomizer took 15954.38ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 73.5MB in the beginning and 1.0GB in the end (delta: -945.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-04-26 16:22:55,836 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.14ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.17ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.38ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 232.03ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 73.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 15954.38ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 73.5MB in the beginning and 1.0GB in the end (delta: -945.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.2s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 2.5s AutomataMinimizationTime, 3 MinimizatonAttempts, 11884 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 5.1s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 374 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 265 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 196 mSDtfsCounter, 265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital64 mio100 ax100 hnf100 lsp68 ukn58 mio100 lsp82 div100 bol100 ite100 ukn100 eq169 hnf95 smp100 dnf126 smp81 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 57ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * l + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:22:55,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...