/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring-nondet.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:53,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:53,900 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:53,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:53,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:53,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:53,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:53,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:53,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:53,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:53,927 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:53,927 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:53,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:53,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:53,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:53,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:53,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:53,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:53,929 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:53,929 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:54,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:54,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:54,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:54,152 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:54,153 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:54,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring-nondet.wvr.bpl [2025-04-26 16:22:54,154 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring-nondet.wvr.bpl' [2025-04-26 16:22:54,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:54,180 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:54,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:54,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:54,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:54,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/1) ... [2025-04-26 16:22:54,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/1) ... [2025-04-26 16:22:54,217 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:54,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:54,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:54,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:54,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:54,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/1) ... [2025-04-26 16:22:54,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/1) ... [2025-04-26 16:22:54,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/1) ... [2025-04-26 16:22:54,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/1) ... [2025-04-26 16:22:54,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/1) ... [2025-04-26 16:22:54,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/1) ... [2025-04-26 16:22:54,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/1) ... [2025-04-26 16:22:54,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/1) ... [2025-04-26 16:22:54,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/1) ... [2025-04-26 16:22:54,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:54,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:54,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:54,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:54,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/1) ... [2025-04-26 16:22:54,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:54,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:54,264 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:54,267 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:54,289 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:54,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:54,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:54,290 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:54,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:54,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:54,290 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:54,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:54,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:54,291 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:54,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:54,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:54,292 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:54,335 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:54,337 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:54,427 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:54,427 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:54,449 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:54,449 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:22:54,450 INFO L201 PluginConnector]: Adding new model ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:54 BoogieIcfgContainer [2025-04-26 16:22:54,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:54,450 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:54,450 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:54,455 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:54,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:54,455 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:54" (1/2) ... [2025-04-26 16:22:54,456 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b83b488 and model type ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:54, skipping insertion in model container [2025-04-26 16:22:54,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:54,457 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:54" (2/2) ... [2025-04-26 16:22:54,458 INFO L376 chiAutomizerObserver]: Analyzing ICFG ring-nondet.wvr.bpl [2025-04-26 16:22:54,506 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:22:54,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 95 flow [2025-04-26 16:22:54,551 INFO L116 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-04-26 16:22:54,552 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:22:54,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 4/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2025-04-26 16:22:54,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 37 transitions, 95 flow [2025-04-26 16:22:54,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 80 flow [2025-04-26 16:22:54,563 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 31 transitions, 80 flow [2025-04-26 16:22:54,573 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:54,574 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:54,574 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:54,574 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:54,574 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:54,574 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:54,574 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:54,574 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:54,576 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:54,684 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 314 [2025-04-26 16:22:54,687 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:54,687 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:54,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:54,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:22:54,689 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:54,690 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 347 states, but on-demand construction may add more states [2025-04-26 16:22:54,704 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 314 [2025-04-26 16:22:54,705 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:54,705 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:54,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:54,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:22:54,712 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:22:54,712 INFO L754 eck$LassoCheckResult]: Loop: "[100] L41-->L33: 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[]" "[102] L33-->L41: Formula: (and (= (+ v_q3_front_15 1) v_q3_front_14) (= (+ v_r_14 v_l_7) v_r_13) (< v_q3_front_15 v_q3_back_6) (= v_l_7 (select v_q3_5 v_q3_front_15))) InVars {q3_front=v_q3_front_15, q3_back=v_q3_back_6, q3=v_q3_5, r=v_r_14} OutVars{q3_front=v_q3_front_14, q3_back=v_q3_back_6, l=v_l_7, q3=v_q3_5, r=v_r_13} AuxVars[] AssignedVars[l, q3_front, r]" [2025-04-26 16:22:54,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash 4058, now seen corresponding path program 1 times [2025-04-26 16:22:54,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:54,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375969930] [2025-04-26 16:22:54,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:54,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:54,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:54,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:54,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:54,771 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:54,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:54,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:54,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:54,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:54,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash 4163, now seen corresponding path program 1 times [2025-04-26 16:22:54,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:54,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024758702] [2025-04-26 16:22:54,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:54,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:54,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:54,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:54,797 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:54,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:54,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:54,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:54,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:54,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:54,804 INFO L85 PathProgramCache]: Analyzing trace with hash 3902940, now seen corresponding path program 1 times [2025-04-26 16:22:54,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:54,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770818928] [2025-04-26 16:22:54,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:54,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:54,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:54,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:54,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:54,867 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:54,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:54,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770818928] [2025-04-26 16:22:54,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770818928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:54,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:54,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:22:54,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299413642] [2025-04-26 16:22:54,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:54,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:54,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:22:54,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:22:54,991 INFO L87 Difference]: Start difference. First operand currently 347 states, but on-demand construction may add more states Second operand has 3 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 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:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:55,061 INFO L93 Difference]: Finished difference Result 564 states and 1708 transitions. [2025-04-26 16:22:55,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 564 states and 1708 transitions. [2025-04-26 16:22:55,091 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 484 [2025-04-26 16:22:55,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 564 states to 522 states and 1598 transitions. [2025-04-26 16:22:55,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 522 [2025-04-26 16:22:55,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 522 [2025-04-26 16:22:55,135 INFO L74 IsDeterministic]: Start isDeterministic. Operand 522 states and 1598 transitions. [2025-04-26 16:22:55,140 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:55,141 INFO L218 hiAutomatonCegarLoop]: Abstraction has 522 states and 1598 transitions. [2025-04-26 16:22:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 1598 transitions. [2025-04-26 16:22:55,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 395. [2025-04-26 16:22:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 395 states have (on average 3.1670886075949367) internal successors, (in total 1251), 394 states have internal predecessors, (1251), 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:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1251 transitions. [2025-04-26 16:22:55,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 395 states and 1251 transitions. [2025-04-26 16:22:55,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:22:55,185 INFO L438 stractBuchiCegarLoop]: Abstraction has 395 states and 1251 transitions. [2025-04-26 16:22:55,185 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:55,185 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 395 states and 1251 transitions. [2025-04-26 16:22:55,188 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 384 [2025-04-26 16:22:55,188 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:55,188 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:55,189 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:55,189 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:22:55,189 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:22:55,189 INFO L754 eck$LassoCheckResult]: Loop: "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" [2025-04-26 16:22:55,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash 4058, now seen corresponding path program 2 times [2025-04-26 16:22:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:55,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453944451] [2025-04-26 16:22:55,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:55,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:55,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:55,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:55,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:55,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:55,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:55,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:55,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:55,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:55,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:55,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:55,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 4164, now seen corresponding path program 1 times [2025-04-26 16:22:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:55,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373941508] [2025-04-26 16:22:55,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:55,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:55,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:55,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:55,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:55,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:55,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:55,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:55,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:55,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:55,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:55,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash 3902941, now seen corresponding path program 1 times [2025-04-26 16:22:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:55,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878518637] [2025-04-26 16:22:55,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:55,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:55,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:55,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:55,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:55,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:55,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:55,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:55,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:55,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:55,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:55,364 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:55,365 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:55,365 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:55,365 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:55,365 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:55,365 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:55,365 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:55,365 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:55,365 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:55,365 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:55,366 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:55,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:55,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:55,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:55,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:55,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:55,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:55,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:55,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:55,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:55,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:55,529 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:55,532 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:55,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:55,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:55,535 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:55,537 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:55,538 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:55,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:55,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:55,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:55,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:55,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:55,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:55,563 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:55,569 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:55,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:55,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:55,572 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:55,573 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:55,575 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:55,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:55,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:55,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:55,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:55,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:55,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:55,590 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:55,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:55,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:55,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:55,598 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:55,599 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:55,601 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:55,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:55,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:55,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:55,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:55,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:55,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:55,618 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:55,624 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:55,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:55,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:55,626 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:55,628 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:55,629 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:55,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:55,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:55,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:55,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:55,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:55,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:55,648 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:55,658 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:22:55,658 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:22:55,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:55,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:55,661 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:55,663 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:55,664 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:55,682 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:55,683 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:55,683 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:55,684 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:22:55,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:22:55,693 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:55,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:55,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:55,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:55,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:55,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:55,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:55,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:55,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:55,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:55,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:55,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:55,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:55,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:55,750 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:55,753 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:55,754 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 395 states and 1251 transitions. cyclomatic complexity: 908 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:55,867 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 395 states and 1251 transitions. cyclomatic complexity: 908. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 1396 states and 4713 transitions. Complement of second has 7 states. [2025-04-26 16:22:55,868 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:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-04-26 16:22:55,872 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:22:55,872 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:55,872 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:22:55,872 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:55,872 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:22:55,872 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:55,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1396 states and 4713 transitions. [2025-04-26 16:22:55,888 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 403 [2025-04-26 16:22:55,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1396 states to 974 states and 3341 transitions. [2025-04-26 16:22:55,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2025-04-26 16:22:55,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 662 [2025-04-26 16:22:55,901 INFO L74 IsDeterministic]: Start isDeterministic. Operand 974 states and 3341 transitions. [2025-04-26 16:22:55,901 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:55,901 INFO L218 hiAutomatonCegarLoop]: Abstraction has 974 states and 3341 transitions. [2025-04-26 16:22:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states and 3341 transitions. [2025-04-26 16:22:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 695. [2025-04-26 16:22:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 695 states have (on average 3.543884892086331) internal successors, (in total 2463), 694 states have internal predecessors, (2463), 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:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 2463 transitions. [2025-04-26 16:22:55,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 695 states and 2463 transitions. [2025-04-26 16:22:55,930 INFO L438 stractBuchiCegarLoop]: Abstraction has 695 states and 2463 transitions. [2025-04-26 16:22:55,930 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:55,930 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 695 states and 2463 transitions. [2025-04-26 16:22:55,933 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 403 [2025-04-26 16:22:55,933 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:55,933 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:55,934 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:55,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:55,934 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[124] L95-1-->L58: 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]" [2025-04-26 16:22:55,934 INFO L754 eck$LassoCheckResult]: Loop: "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:22:55,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash 125922, now seen corresponding path program 1 times [2025-04-26 16:22:55,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:55,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231165688] [2025-04-26 16:22:55,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:55,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:55,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:55,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:55,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:55,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:55,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:55,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:55,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:55,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:55,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:55,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:55,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash 129848075, now seen corresponding path program 1 times [2025-04-26 16:22:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:55,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652700575] [2025-04-26 16:22:55,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:55,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:55,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:55,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:55,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:55,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:55,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:55,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:55,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:55,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:55,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:55,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:55,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1663609802, now seen corresponding path program 1 times [2025-04-26 16:22:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:55,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939263159] [2025-04-26 16:22:55,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:55,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:55,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:55,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:55,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:55,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:56,017 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:56,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:56,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939263159] [2025-04-26 16:22:56,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939263159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:56,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:56,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:22:56,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637876385] [2025-04-26 16:22:56,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:56,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:22:56,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:22:56,105 INFO L87 Difference]: Start difference. First operand 695 states and 2463 transitions. cyclomatic complexity: 1842 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 2 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:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:56,136 INFO L93 Difference]: Finished difference Result 942 states and 3189 transitions. [2025-04-26 16:22:56,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 942 states and 3189 transitions. [2025-04-26 16:22:56,144 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 499 [2025-04-26 16:22:56,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 942 states to 938 states and 3179 transitions. [2025-04-26 16:22:56,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2025-04-26 16:22:56,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2025-04-26 16:22:56,154 INFO L74 IsDeterministic]: Start isDeterministic. Operand 938 states and 3179 transitions. [2025-04-26 16:22:56,154 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:56,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 938 states and 3179 transitions. [2025-04-26 16:22:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states and 3179 transitions. [2025-04-26 16:22:56,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 828. [2025-04-26 16:22:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 828 states have (on average 3.475845410628019) internal successors, (in total 2878), 827 states have internal predecessors, (2878), 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:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 2878 transitions. [2025-04-26 16:22:56,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 828 states and 2878 transitions. [2025-04-26 16:22:56,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:22:56,177 INFO L438 stractBuchiCegarLoop]: Abstraction has 828 states and 2878 transitions. [2025-04-26 16:22:56,177 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:22:56,177 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 828 states and 2878 transitions. [2025-04-26 16:22:56,182 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 451 [2025-04-26 16:22:56,182 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:56,182 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:56,182 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:56,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:56,183 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L41-->L49: Formula: (<= v_N_2 v_i_4) InVars {i=v_i_4, N=v_N_2} OutVars{i=v_i_4, N=v_N_2} AuxVars[] AssignedVars[]" "[101] L49-->thread1FINAL: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[124] L95-1-->L58: 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]" [2025-04-26 16:22:56,183 INFO L754 eck$LassoCheckResult]: Loop: "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:22:56,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash 120990272, now seen corresponding path program 1 times [2025-04-26 16:22:56,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:56,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815974632] [2025-04-26 16:22:56,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:56,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:56,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:56,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:56,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:56,188 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:56,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:56,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:56,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:56,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:56,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:56,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash 129848075, now seen corresponding path program 2 times [2025-04-26 16:22:56,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:56,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879569701] [2025-04-26 16:22:56,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:56,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:56,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:56,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:56,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:56,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:56,200 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:56,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:56,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:56,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:56,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:56,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:56,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash 693286956, now seen corresponding path program 1 times [2025-04-26 16:22:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:56,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873858041] [2025-04-26 16:22:56,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:56,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:56,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:22:56,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:22:56,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:56,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:56,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:56,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:22:56,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:22:56,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:56,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:56,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:56,426 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:56,427 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:56,427 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:56,427 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:56,427 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:56,427 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:56,427 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:56,427 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:56,427 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:22:56,427 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:56,427 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:56,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:56,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:56,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:56,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:56,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:56,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:56,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:56,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:56,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:56,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:56,703 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:56,703 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:56,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:56,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:56,706 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:56,707 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:56,708 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:56,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:56,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:56,718 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:56,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:56,730 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:22:56,730 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:56,746 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:56,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:22:56,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:56,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:56,756 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:56,757 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:56,758 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:56,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:56,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:56,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:56,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:56,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:56,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:56,774 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:56,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:22:56,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:56,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:56,810 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:56,811 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:56,812 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:56,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:56,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:56,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:56,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:56,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:56,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:56,828 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:56,838 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:22:56,838 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:22:56,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:56,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:56,840 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:56,841 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:56,842 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:56,860 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:56,863 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:56,863 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:56,863 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:22:56,871 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:56,872 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:56,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:56,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:56,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:56,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:56,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:56,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:56,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:56,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:56,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:56,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:56,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:56,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:56,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:56,942 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:56,942 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:56,943 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 828 states and 2878 transitions. cyclomatic complexity: 2140 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:56,998 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 828 states and 2878 transitions. cyclomatic complexity: 2140. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2399 states and 7729 transitions. Complement of second has 5 states. [2025-04-26 16:22:56,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-04-26 16:22:57,001 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 5 letters. Loop has 5 letters. [2025-04-26 16:22:57,001 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:57,001 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 10 letters. Loop has 5 letters. [2025-04-26 16:22:57,001 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:57,001 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 5 letters. Loop has 10 letters. [2025-04-26 16:22:57,001 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:57,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2399 states and 7729 transitions. [2025-04-26 16:22:57,022 INFO L131 ngComponentsAnalysis]: Automaton has 117 accepting balls. 729 [2025-04-26 16:22:57,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2399 states to 2018 states and 6618 transitions. [2025-04-26 16:22:57,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 892 [2025-04-26 16:22:57,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1037 [2025-04-26 16:22:57,041 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2018 states and 6618 transitions. [2025-04-26 16:22:57,041 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:57,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2018 states and 6618 transitions. [2025-04-26 16:22:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states and 6618 transitions. [2025-04-26 16:22:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1601. [2025-04-26 16:22:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1601 states have (on average 3.377264209868832) internal successors, (in total 5407), 1600 states have internal predecessors, (5407), 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:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 5407 transitions. [2025-04-26 16:22:57,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1601 states and 5407 transitions. [2025-04-26 16:22:57,095 INFO L438 stractBuchiCegarLoop]: Abstraction has 1601 states and 5407 transitions. [2025-04-26 16:22:57,095 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:22:57,095 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1601 states and 5407 transitions. [2025-04-26 16:22:57,129 INFO L131 ngComponentsAnalysis]: Automaton has 90 accepting balls. 598 [2025-04-26 16:22:57,129 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:57,129 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:57,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:57,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:57,130 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L41-->L49: Formula: (<= v_N_2 v_i_4) InVars {i=v_i_4, N=v_N_2} OutVars{i=v_i_4, N=v_N_2} AuxVars[] AssignedVars[]" "[124] L95-1-->L58: 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]" "[101] L49-->thread1FINAL: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:22:57,130 INFO L754 eck$LassoCheckResult]: Loop: "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:22:57,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash 120990962, now seen corresponding path program 2 times [2025-04-26 16:22:57,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050631006] [2025-04-26 16:22:57,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:57,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,147 INFO L85 PathProgramCache]: Analyzing trace with hash 129848075, now seen corresponding path program 3 times [2025-04-26 16:22:57,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,147 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690404259] [2025-04-26 16:22:57,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:57,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:57,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1027435334, now seen corresponding path program 2 times [2025-04-26 16:22:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059659308] [2025-04-26 16:22:57,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:57,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:22:57,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:22:57,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:57,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:22:57,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:22:57,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,361 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:57,361 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:57,361 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:57,361 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:57,361 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:57,362 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:57,362 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:57,362 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:57,362 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:22:57,362 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:57,362 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:57,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,626 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:57,626 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:57,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:57,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:57,631 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:57,632 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:57,634 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:57,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:57,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:57,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:57,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:57,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:57,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:57,651 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:57,656 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:57,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:57,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:57,659 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:57,660 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:57,662 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:57,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:57,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:57,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:57,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:57,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:57,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:57,678 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:57,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:57,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:57,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:57,687 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:57,688 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:57,689 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:57,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:57,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:57,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:57,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:57,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:57,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:57,703 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:57,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:22:57,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:57,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:57,711 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:57,713 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:57,714 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:57,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:57,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:57,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:57,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:57,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:57,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:57,728 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:57,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:22:57,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:57,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:57,736 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:57,737 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:57,738 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:57,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:57,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:57,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:57,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:57,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:57,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:57,753 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:57,759 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:57,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:57,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:57,761 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:57,763 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:57,764 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:57,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:57,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:57,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:57,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:57,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:57,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:57,778 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:57,784 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:57,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:57,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:57,786 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:57,788 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:57,789 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:57,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:57,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:57,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:57,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:57,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:57,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:57,806 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:57,815 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:22:57,815 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:22:57,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:57,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:57,818 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:57,819 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:57,820 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:57,836 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:57,837 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:57,837 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:57,837 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 16:22:57,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:57,843 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:57,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:57,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:57,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:57,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:57,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:57,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:57,885 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:57,886 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:57,886 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1601 states and 5407 transitions. cyclomatic complexity: 3975 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:57,945 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1601 states and 5407 transitions. cyclomatic complexity: 3975. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2176 states and 7214 transitions. Complement of second has 4 states. [2025-04-26 16:22:57,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:57,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-04-26 16:22:57,946 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 5 letters. Loop has 5 letters. [2025-04-26 16:22:57,946 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:57,947 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 10 letters. Loop has 5 letters. [2025-04-26 16:22:57,947 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:57,947 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 5 letters. Loop has 10 letters. [2025-04-26 16:22:57,947 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:57,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2176 states and 7214 transitions. [2025-04-26 16:22:57,961 INFO L131 ngComponentsAnalysis]: Automaton has 94 accepting balls. 558 [2025-04-26 16:22:57,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2176 states to 1794 states and 5997 transitions. [2025-04-26 16:22:57,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 702 [2025-04-26 16:22:57,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 830 [2025-04-26 16:22:57,976 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1794 states and 5997 transitions. [2025-04-26 16:22:57,976 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:57,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1794 states and 5997 transitions. [2025-04-26 16:22:57,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states and 5997 transitions. [2025-04-26 16:22:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1449. [2025-04-26 16:22:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1449 states have (on average 3.474120082815735) internal successors, (in total 5034), 1448 states have internal predecessors, (5034), 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:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 5034 transitions. [2025-04-26 16:22:58,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1449 states and 5034 transitions. [2025-04-26 16:22:58,014 INFO L438 stractBuchiCegarLoop]: Abstraction has 1449 states and 5034 transitions. [2025-04-26 16:22:58,014 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:22:58,015 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1449 states and 5034 transitions. [2025-04-26 16:22:58,024 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 483 [2025-04-26 16:22:58,025 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:58,025 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:58,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:58,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:58,026 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L41-->L49: Formula: (<= v_N_2 v_i_4) InVars {i=v_i_4, N=v_N_2} OutVars{i=v_i_4, N=v_N_2} AuxVars[] AssignedVars[]" "[124] L95-1-->L58: 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]" "[127] L96-->L76: 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:58,026 INFO L754 eck$LassoCheckResult]: Loop: "[113] L76-->L77: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[115] L77-->L77-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[116] L77-1-->L82: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[117] L82-->L87: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[118] L87-->L76: Formula: (or (and (<= v_k_3 0) (not v_g_2)) (and v_g_2 (< 0 v_k_3))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:22:58,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash 120990988, now seen corresponding path program 1 times [2025-04-26 16:22:58,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675304169] [2025-04-26 16:22:58,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:58,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:58,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:58,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:58,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:58,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:58,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:58,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,034 INFO L85 PathProgramCache]: Analyzing trace with hash 136528210, now seen corresponding path program 1 times [2025-04-26 16:22:58,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745524432] [2025-04-26 16:22:58,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:58,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:58,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:58,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:58,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:58,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:58,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:58,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash -276397273, now seen corresponding path program 1 times [2025-04-26 16:22:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497106007] [2025-04-26 16:22:58,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:22:58,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:22:58,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:58,066 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:58,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:58,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497106007] [2025-04-26 16:22:58,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497106007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:58,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:58,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:22:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609556322] [2025-04-26 16:22:58,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:58,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:58,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:22:58,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:22:58,147 INFO L87 Difference]: Start difference. First operand 1449 states and 5034 transitions. cyclomatic complexity: 3737 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:58,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:58,183 INFO L93 Difference]: Finished difference Result 1781 states and 6022 transitions. [2025-04-26 16:22:58,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1781 states and 6022 transitions. [2025-04-26 16:22:58,197 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 483 [2025-04-26 16:22:58,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1781 states to 1703 states and 5782 transitions. [2025-04-26 16:22:58,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 678 [2025-04-26 16:22:58,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 678 [2025-04-26 16:22:58,212 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1703 states and 5782 transitions. [2025-04-26 16:22:58,212 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:58,212 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1703 states and 5782 transitions. [2025-04-26 16:22:58,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states and 5782 transitions. [2025-04-26 16:22:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1639. [2025-04-26 16:22:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1639 states have (on average 3.422208663819402) internal successors, (in total 5609), 1638 states have internal predecessors, (5609), 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:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 5609 transitions. [2025-04-26 16:22:58,268 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1639 states and 5609 transitions. [2025-04-26 16:22:58,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:22:58,269 INFO L438 stractBuchiCegarLoop]: Abstraction has 1639 states and 5609 transitions. [2025-04-26 16:22:58,269 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:22:58,269 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1639 states and 5609 transitions. [2025-04-26 16:22:58,278 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 483 [2025-04-26 16:22:58,278 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:58,278 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:58,278 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:58,278 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:58,279 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[127] L96-->L76: 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]" "[112] L76-->thread3FINAL: Formula: (not v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" [2025-04-26 16:22:58,279 INFO L754 eck$LassoCheckResult]: Loop: "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:22:58,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash 309126982, now seen corresponding path program 1 times [2025-04-26 16:22:58,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460100354] [2025-04-26 16:22:58,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:22:58,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:22:58,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:58,293 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:58,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:58,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460100354] [2025-04-26 16:22:58,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460100354] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:58,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:58,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:22:58,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407430104] [2025-04-26 16:22:58,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:58,293 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:22:58,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash 129848075, now seen corresponding path program 4 times [2025-04-26 16:22:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251334617] [2025-04-26 16:22:58,294 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:58,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,297 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 16:22:58,301 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:58,301 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:58,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:58,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:58,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:58,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:58,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:58,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:22:58,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:22:58,378 INFO L87 Difference]: Start difference. First operand 1639 states and 5609 transitions. cyclomatic complexity: 4131 Second operand has 3 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 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:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:58,414 INFO L93 Difference]: Finished difference Result 1608 states and 5446 transitions. [2025-04-26 16:22:58,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1608 states and 5446 transitions. [2025-04-26 16:22:58,427 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 468 [2025-04-26 16:22:58,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1608 states to 1608 states and 5446 transitions. [2025-04-26 16:22:58,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 679 [2025-04-26 16:22:58,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 679 [2025-04-26 16:22:58,441 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1608 states and 5446 transitions. [2025-04-26 16:22:58,441 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:58,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1608 states and 5446 transitions. [2025-04-26 16:22:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states and 5446 transitions. [2025-04-26 16:22:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1550. [2025-04-26 16:22:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1550 states have (on average 3.4) internal successors, (in total 5270), 1549 states have internal predecessors, (5270), 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:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 5270 transitions. [2025-04-26 16:22:58,480 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1550 states and 5270 transitions. [2025-04-26 16:22:58,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:22:58,481 INFO L438 stractBuchiCegarLoop]: Abstraction has 1550 states and 5270 transitions. [2025-04-26 16:22:58,481 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:22:58,481 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1550 states and 5270 transitions. [2025-04-26 16:22:58,488 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 468 [2025-04-26 16:22:58,489 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:58,489 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:58,489 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:58,489 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:58,491 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:22:58,491 INFO L754 eck$LassoCheckResult]: Loop: "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:22:58,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,491 INFO L85 PathProgramCache]: Analyzing trace with hash 992981654, now seen corresponding path program 1 times [2025-04-26 16:22:58,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238224898] [2025-04-26 16:22:58,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:58,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:58,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:58,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,501 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:58,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:58,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:58,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:58,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash 133628585, now seen corresponding path program 5 times [2025-04-26 16:22:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269521857] [2025-04-26 16:22:58,510 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,515 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:58,516 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:58,516 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:58,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,516 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:58,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:58,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:58,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:58,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,520 INFO L85 PathProgramCache]: Analyzing trace with hash 789095732, now seen corresponding path program 1 times [2025-04-26 16:22:58,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312756847] [2025-04-26 16:22:58,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:58,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:58,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:58,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:58,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:58,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312756847] [2025-04-26 16:22:58,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312756847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:58,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:58,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:22:58,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269539908] [2025-04-26 16:22:58,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:58,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:58,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:22:58,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:22:58,630 INFO L87 Difference]: Start difference. First operand 1550 states and 5270 transitions. cyclomatic complexity: 3872 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:58,697 INFO L93 Difference]: Finished difference Result 3596 states and 11676 transitions. [2025-04-26 16:22:58,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3596 states and 11676 transitions. [2025-04-26 16:22:58,719 INFO L131 ngComponentsAnalysis]: Automaton has 210 accepting balls. 1120 [2025-04-26 16:22:58,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3596 states to 3252 states and 10675 transitions. [2025-04-26 16:22:58,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1637 [2025-04-26 16:22:58,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1705 [2025-04-26 16:22:58,745 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3252 states and 10675 transitions. [2025-04-26 16:22:58,745 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:58,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3252 states and 10675 transitions. [2025-04-26 16:22:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states and 10675 transitions. [2025-04-26 16:22:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 2321. [2025-04-26 16:22:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2321 states have (on average 3.4687634640241276) internal successors, (in total 8051), 2320 states have internal predecessors, (8051), 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:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 8051 transitions. [2025-04-26 16:22:58,804 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2321 states and 8051 transitions. [2025-04-26 16:22:58,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:22:58,805 INFO L438 stractBuchiCegarLoop]: Abstraction has 2321 states and 8051 transitions. [2025-04-26 16:22:58,805 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:22:58,805 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2321 states and 8051 transitions. [2025-04-26 16:22:58,815 INFO L131 ngComponentsAnalysis]: Automaton has 111 accepting balls. 638 [2025-04-26 16:22:58,815 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:58,815 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:58,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:58,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:58,816 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L41-->L49: Formula: (<= v_N_2 v_i_4) InVars {i=v_i_4, N=v_N_2} OutVars{i=v_i_4, N=v_N_2} AuxVars[] AssignedVars[]" "[101] L49-->thread1FINAL: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L96-->L76: 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:58,816 INFO L754 eck$LassoCheckResult]: Loop: "[113] L76-->L77: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[115] L77-->L77-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[116] L77-1-->L82: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[117] L82-->L87: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[118] L87-->L76: Formula: (or (and (<= v_k_3 0) (not v_g_2)) (and v_g_2 (< 0 v_k_3))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:22:58,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash -808919884, now seen corresponding path program 1 times [2025-04-26 16:22:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790500048] [2025-04-26 16:22:58,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:22:58,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:22:58,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:58,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:22:58,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:22:58,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:58,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,826 INFO L85 PathProgramCache]: Analyzing trace with hash 136528210, now seen corresponding path program 2 times [2025-04-26 16:22:58,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174078142] [2025-04-26 16:22:58,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:58,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:58,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:58,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:58,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,828 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:58,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:58,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:58,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:58,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1895259263, now seen corresponding path program 1 times [2025-04-26 16:22:58,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011555751] [2025-04-26 16:22:58,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:58,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:58,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:58,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,843 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:58,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:58,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:58,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:59,111 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:59,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:59,111 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:59,112 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:59,112 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:59,112 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,112 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:59,112 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:59,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:22:59,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:59,112 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:59,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:59,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:59,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:59,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:59,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:59,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:59,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:59,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:59,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:59,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:59,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:59,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:59,473 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:59,473 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:59,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,478 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:59,479 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:59,479 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:59,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,494 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,499 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:59,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,501 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:59,502 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:59,502 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:59,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,518 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:22:59,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,525 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:59,526 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:59,527 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:59,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,544 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:59,553 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:22:59,553 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:22:59,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,556 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:59,556 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:59,558 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:59,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:22:59,573 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:59,573 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:59,574 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 16:22:59,578 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:59,581 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:59,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:59,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:22:59,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:22:59,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:59,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:59,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:59,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:59,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:59,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:59,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:59,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:59,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:59,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:59,629 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:59,629 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:59,629 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2321 states and 8051 transitions. cyclomatic complexity: 5939 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:59,691 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2321 states and 8051 transitions. cyclomatic complexity: 5939. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 7765 states and 26995 transitions. Complement of second has 5 states. [2025-04-26 16:22:59,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-26 16:22:59,692 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 53 transitions. Stem has 9 letters. Loop has 5 letters. [2025-04-26 16:22:59,692 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:59,693 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 53 transitions. Stem has 14 letters. Loop has 5 letters. [2025-04-26 16:22:59,693 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:59,693 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 53 transitions. Stem has 9 letters. Loop has 10 letters. [2025-04-26 16:22:59,693 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:59,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7765 states and 26995 transitions. [2025-04-26 16:22:59,744 INFO L131 ngComponentsAnalysis]: Automaton has 230 accepting balls. 876 [2025-04-26 16:22:59,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7765 states to 6784 states and 23507 transitions. [2025-04-26 16:22:59,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1994 [2025-04-26 16:22:59,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2484 [2025-04-26 16:22:59,803 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6784 states and 23507 transitions. [2025-04-26 16:22:59,803 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:59,803 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6784 states and 23507 transitions. [2025-04-26 16:22:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states and 23507 transitions. [2025-04-26 16:22:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 5663. [2025-04-26 16:22:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5663 states, 5663 states have (on average 3.5904997351227266) internal successors, (in total 20333), 5662 states have internal predecessors, (20333), 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:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5663 states to 5663 states and 20333 transitions. [2025-04-26 16:22:59,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5663 states and 20333 transitions. [2025-04-26 16:22:59,977 INFO L438 stractBuchiCegarLoop]: Abstraction has 5663 states and 20333 transitions. [2025-04-26 16:22:59,977 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:22:59,977 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5663 states and 20333 transitions. [2025-04-26 16:22:59,999 INFO L131 ngComponentsAnalysis]: Automaton has 196 accepting balls. 808 [2025-04-26 16:23:00,000 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:00,000 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:00,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:00,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:00,001 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L41-->L49: Formula: (<= v_N_2 v_i_4) InVars {i=v_i_4, N=v_N_2} OutVars{i=v_i_4, N=v_N_2} AuxVars[] AssignedVars[]" "[101] L49-->thread1FINAL: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[127] L96-->L76: 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]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:00,001 INFO L754 eck$LassoCheckResult]: Loop: "[113] L76-->L77: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[115] L77-->L77-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[116] L77-1-->L82: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[117] L82-->L87: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[118] L87-->L76: Formula: (or (and (<= v_k_3 0) (not v_g_2)) (and v_g_2 (< 0 v_k_3))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:23:00,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:00,001 INFO L85 PathProgramCache]: Analyzing trace with hash -808919344, now seen corresponding path program 2 times [2025-04-26 16:23:00,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:00,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810857526] [2025-04-26 16:23:00,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:00,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:00,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:00,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:00,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:00,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:00,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:00,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:00,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:00,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:00,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash 136528210, now seen corresponding path program 3 times [2025-04-26 16:23:00,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:00,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827964173] [2025-04-26 16:23:00,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:00,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:00,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:00,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:00,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,012 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:00,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:00,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:00,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:00,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:00,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:00,015 INFO L85 PathProgramCache]: Analyzing trace with hash 175131619, now seen corresponding path program 2 times [2025-04-26 16:23:00,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:00,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32582197] [2025-04-26 16:23:00,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:00,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:00,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:00,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:00,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:00,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:00,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:00,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:00,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:00,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:00,241 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:00,241 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:00,241 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:00,241 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:00,241 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:00,241 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,241 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:00,241 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:00,241 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:23:00,241 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:00,241 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:00,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:00,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:00,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:00,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:00,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:00,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:00,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:00,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:00,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:00,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:00,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:00,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:00,668 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:00,668 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:00,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,671 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:00,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:23:00,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:00,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:00,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:00,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:00,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:00,689 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:23:00,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,697 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:00,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:23:00,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:00,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:00,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:00,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:00,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:00,714 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:23:00,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,723 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:23:00,725 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:23:00,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:00,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:00,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:00,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:00,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:00,739 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,745 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:23:00,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,747 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:23:00,747 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:23:00,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:00,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:00,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:00,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:00,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:00,762 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:23:00,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,770 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:23:00,771 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:23:00,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:00,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:00,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:00,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:00,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:00,785 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:00,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,792 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:23:00,794 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:23:00,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:00,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:00,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:00,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:00,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:00,810 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,815 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:23:00,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,817 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:23:00,818 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:23:00,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:00,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:00,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,829 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:00,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:00,842 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:23:00,842 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:00,863 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,869 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:23:00,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,872 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:23:00,874 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:23:00,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:00,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:00,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:00,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:00,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:00,890 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:00,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:23:00,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,898 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:23:00,900 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:23:00,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:00,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:00,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:00,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:00,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:00,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:00,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:00,917 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:00,924 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:00,924 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:00,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:00,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:00,925 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:23:00,927 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:23:00,928 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:00,944 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:23:00,944 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:00,944 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:00,944 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 16:23:00,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:23:00,951 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:00,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:00,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:00,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:00,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:00,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:00,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:00,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:00,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:00,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:00,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:00,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:00,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:00,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:01,010 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:01,010 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5663 states and 20333 transitions. cyclomatic complexity: 15312 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:01,196 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5663 states and 20333 transitions. cyclomatic complexity: 15312. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 19009 states and 67466 transitions. Complement of second has 5 states. [2025-04-26 16:23:01,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-26 16:23:01,197 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 9 letters. Loop has 5 letters. [2025-04-26 16:23:01,197 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:01,197 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 14 letters. Loop has 5 letters. [2025-04-26 16:23:01,197 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:01,198 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 9 letters. Loop has 10 letters. [2025-04-26 16:23:01,198 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:01,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19009 states and 67466 transitions. [2025-04-26 16:23:01,350 INFO L131 ngComponentsAnalysis]: Automaton has 400 accepting balls. 1216 [2025-04-26 16:23:01,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19009 states to 14549 states and 50814 transitions. [2025-04-26 16:23:01,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3876 [2025-04-26 16:23:01,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4453 [2025-04-26 16:23:01,478 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14549 states and 50814 transitions. [2025-04-26 16:23:01,478 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:01,478 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14549 states and 50814 transitions. [2025-04-26 16:23:01,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14549 states and 50814 transitions. [2025-04-26 16:23:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14549 to 6287. [2025-04-26 16:23:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6287 states, 6287 states have (on average 3.5452521075234613) internal successors, (in total 22289), 6286 states have internal predecessors, (22289), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6287 states to 6287 states and 22289 transitions. [2025-04-26 16:23:01,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6287 states and 22289 transitions. [2025-04-26 16:23:01,706 INFO L438 stractBuchiCegarLoop]: Abstraction has 6287 states and 22289 transitions. [2025-04-26 16:23:01,706 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:23:01,706 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6287 states and 22289 transitions. [2025-04-26 16:23:01,732 INFO L131 ngComponentsAnalysis]: Automaton has 196 accepting balls. 808 [2025-04-26 16:23:01,732 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:01,732 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:01,733 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:01,733 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:01,733 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L96-->L76: 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]" "[113] L76-->L77: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[115] L77-->L77-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[116] L77-1-->L82: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" [2025-04-26 16:23:01,733 INFO L754 eck$LassoCheckResult]: Loop: "[102] L33-->L41: Formula: (and (= (+ v_q3_front_15 1) v_q3_front_14) (= (+ v_r_14 v_l_7) v_r_13) (< v_q3_front_15 v_q3_back_6) (= v_l_7 (select v_q3_5 v_q3_front_15))) InVars {q3_front=v_q3_front_15, q3_back=v_q3_back_6, q3=v_q3_5, r=v_r_14} OutVars{q3_front=v_q3_front_14, q3_back=v_q3_back_6, l=v_l_7, q3=v_q3_5, r=v_r_13} AuxVars[] AssignedVars[l, q3_front, r]" "[100] L41-->L33: 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[]" [2025-04-26 16:23:01,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1250046665, now seen corresponding path program 1 times [2025-04-26 16:23:01,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:01,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385733754] [2025-04-26 16:23:01,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:01,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:01,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:01,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:01,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:01,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:01,738 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:01,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:01,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:01,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:01,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:01,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:01,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:01,745 INFO L85 PathProgramCache]: Analyzing trace with hash 4223, now seen corresponding path program 2 times [2025-04-26 16:23:01,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:01,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629478083] [2025-04-26 16:23:01,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:01,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:01,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:01,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:01,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:01,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:01,747 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:01,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:01,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:01,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:01,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:01,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:01,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1295994553, now seen corresponding path program 1 times [2025-04-26 16:23:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:01,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218349266] [2025-04-26 16:23:01,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:01,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:01,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:01,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:01,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:01,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:01,756 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:01,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:01,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:01,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:01,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:01,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:02,033 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:02,033 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:02,033 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:02,033 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:02,033 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:02,033 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,033 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:02,033 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:02,033 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration11_Lasso [2025-04-26 16:23:02,033 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:02,033 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:02,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:02,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:02,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:02,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:02,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:02,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:02,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:02,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:02,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:02,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:02,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:02,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:02,297 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:02,297 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:02,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,299 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:23:02,300 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:23:02,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,313 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:23:02,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,320 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:23:02,321 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:23:02,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,335 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:23:02,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,342 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:23:02,343 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:23:02,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,356 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:23:02,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,363 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:02,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:23:02,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,385 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:23:02,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,393 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:02,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:23:02,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,413 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:02,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,421 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:02,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:23:02,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,438 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:23:02,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,446 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:02,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:23:02,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,461 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:02,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,469 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:02,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:23:02,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,483 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:02,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,490 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:02,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:23:02,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,505 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:23:02,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,512 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:02,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:23:02,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,527 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 16:23:02,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,535 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:02,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:23:02,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,552 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 16:23:02,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,559 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:02,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:23:02,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,585 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:02,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 16:23:02,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,592 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:02,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:23:02,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,609 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:02,617 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:23:02,617 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:02,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,619 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:02,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:23:02,622 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:02,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 16:23:02,638 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:02,638 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:02,638 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q3_back, q3_front) = 1*q3_back - 1*q3_front Supporting invariants [] [2025-04-26 16:23:02,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 16:23:02,649 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:23:02,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:02,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:02,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:02,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:02,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:02,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:02,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:02,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:02,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:02,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:02,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:02,702 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:02,702 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6287 states and 22289 transitions. cyclomatic complexity: 16662 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:02,826 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6287 states and 22289 transitions. cyclomatic complexity: 16662. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 18524 states and 65016 transitions. Complement of second has 5 states. [2025-04-26 16:23:02,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-04-26 16:23:02,828 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:23:02,828 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:02,828 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 16:23:02,828 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:02,828 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:23:02,828 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:02,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18524 states and 65016 transitions. [2025-04-26 16:23:03,013 INFO L131 ngComponentsAnalysis]: Automaton has 226 accepting balls. 958 [2025-04-26 16:23:03,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18524 states to 15847 states and 55312 transitions. [2025-04-26 16:23:03,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4207 [2025-04-26 16:23:03,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4778 [2025-04-26 16:23:03,106 INFO L74 IsDeterministic]: Start isDeterministic. Operand 15847 states and 55312 transitions. [2025-04-26 16:23:03,107 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:03,107 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15847 states and 55312 transitions. [2025-04-26 16:23:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15847 states and 55312 transitions. [2025-04-26 16:23:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15847 to 12277. [2025-04-26 16:23:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12277 states, 12277 states have (on average 3.661643724036817) internal successors, (in total 44954), 12276 states have internal predecessors, (44954), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12277 states to 12277 states and 44954 transitions. [2025-04-26 16:23:03,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12277 states and 44954 transitions. [2025-04-26 16:23:03,364 INFO L438 stractBuchiCegarLoop]: Abstraction has 12277 states and 44954 transitions. [2025-04-26 16:23:03,364 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:23:03,364 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12277 states and 44954 transitions. [2025-04-26 16:23:03,412 INFO L131 ngComponentsAnalysis]: Automaton has 219 accepting balls. 923 [2025-04-26 16:23:03,412 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:03,412 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:03,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-26 16:23:03,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:03,413 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:03,413 INFO L754 eck$LassoCheckResult]: Loop: "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:03,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash -764979375, now seen corresponding path program 2 times [2025-04-26 16:23:03,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:03,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898643790] [2025-04-26 16:23:03,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:03,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:03,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-26 16:23:03,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:03,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:03,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,423 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:03,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:03,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:03,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:03,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,433 INFO L85 PathProgramCache]: Analyzing trace with hash 133628585, now seen corresponding path program 6 times [2025-04-26 16:23:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:03,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836970420] [2025-04-26 16:23:03,433 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:03,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:03,435 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:03,435 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:03,437 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:23:03,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,437 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:03,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:03,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:03,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:03,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1676559015, now seen corresponding path program 3 times [2025-04-26 16:23:03,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:03,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748764840] [2025-04-26 16:23:03,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:03,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:03,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-26 16:23:03,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:23:03,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:23:03,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:03,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:03,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748764840] [2025-04-26 16:23:03,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748764840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:23:03,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458557973] [2025-04-26 16:23:03,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:03,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:23:03,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:03,564 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:23:03,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-26 16:23:03,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-26 16:23:03,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:23:03,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:23:03,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:03,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:23:03,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:03,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:23:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:03,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458557973] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:23:03,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:23:03,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-04-26 16:23:03,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413915609] [2025-04-26 16:23:03,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:23:03,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:03,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:23:03,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:23:03,717 INFO L87 Difference]: Start difference. First operand 12277 states and 44954 transitions. cyclomatic complexity: 34124 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:03,922 INFO L93 Difference]: Finished difference Result 28702 states and 102320 transitions. [2025-04-26 16:23:03,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28702 states and 102320 transitions. [2025-04-26 16:23:04,234 INFO L131 ngComponentsAnalysis]: Automaton has 571 accepting balls. 2183 [2025-04-26 16:23:04,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28702 states to 26482 states and 94783 transitions. [2025-04-26 16:23:04,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7536 [2025-04-26 16:23:04,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7876 [2025-04-26 16:23:04,513 INFO L74 IsDeterministic]: Start isDeterministic. Operand 26482 states and 94783 transitions. [2025-04-26 16:23:04,513 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:04,513 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26482 states and 94783 transitions. [2025-04-26 16:23:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26482 states and 94783 transitions. [2025-04-26 16:23:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26482 to 17369. [2025-04-26 16:23:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17369 states, 17369 states have (on average 3.66543842477978) internal successors, (in total 63665), 17368 states have internal predecessors, (63665), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17369 states to 17369 states and 63665 transitions. [2025-04-26 16:23:04,942 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17369 states and 63665 transitions. [2025-04-26 16:23:04,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:23:04,943 INFO L438 stractBuchiCegarLoop]: Abstraction has 17369 states and 63665 transitions. [2025-04-26 16:23:04,943 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 16:23:04,943 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17369 states and 63665 transitions. [2025-04-26 16:23:05,040 INFO L131 ngComponentsAnalysis]: Automaton has 269 accepting balls. 1093 [2025-04-26 16:23:05,040 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:05,040 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:05,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:05,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:05,041 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[99] L41-->L49: Formula: (<= v_N_2 v_i_4) InVars {i=v_i_4, N=v_N_2} OutVars{i=v_i_4, N=v_N_2} AuxVars[] AssignedVars[]" "[101] L49-->thread1FINAL: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[127] L96-->L76: 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]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:05,041 INFO L754 eck$LassoCheckResult]: Loop: "[113] L76-->L77: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[115] L77-->L77-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[116] L77-1-->L82: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[117] L82-->L87: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[118] L87-->L76: Formula: (or (and (<= v_k_3 0) (not v_g_2)) (and v_g_2 (< 0 v_k_3))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:23:05,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 489675867, now seen corresponding path program 1 times [2025-04-26 16:23:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:05,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361846589] [2025-04-26 16:23:05,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:05,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:05,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:05,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:05,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:05,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:05,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:05,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:05,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:05,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:05,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:05,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:05,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash 136528210, now seen corresponding path program 4 times [2025-04-26 16:23:05,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:05,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131245893] [2025-04-26 16:23:05,062 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:05,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:05,064 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 16:23:05,065 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:05,065 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:05,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:05,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:05,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:05,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:05,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:05,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:05,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:05,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:05,070 INFO L85 PathProgramCache]: Analyzing trace with hash -737080008, now seen corresponding path program 1 times [2025-04-26 16:23:05,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:05,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029949762] [2025-04-26 16:23:05,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:05,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:05,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:05,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:05,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:05,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:05,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:05,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:05,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:05,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:05,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:05,536 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:05,536 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:05,536 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:05,536 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:05,536 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:05,536 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:05,536 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:05,536 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:05,536 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration13_Lasso [2025-04-26 16:23:05,536 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:05,536 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:05,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:05,902 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:05,902 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:05,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:05,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:05,904 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:05,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:23:05,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:05,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:05,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:05,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:05,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:05,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:05,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:05,920 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:05,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:05,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:05,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:05,928 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:05,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:23:05,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:05,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:05,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:05,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:05,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:05,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:05,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:05,945 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:05,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:23:05,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:05,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:05,952 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:05,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:23:05,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:05,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:05,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:05,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:05,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:05,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:05,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:05,967 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:05,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-04-26 16:23:05,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:05,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:05,974 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:05,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:23:05,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:05,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:05,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:05,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:05,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:05,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:05,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:05,990 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:05,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 16:23:05,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:05,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:05,998 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:05,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:23:05,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:06,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:06,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:06,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:06,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:06,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:06,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:06,015 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:06,020 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:23:06,020 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:06,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:06,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:06,038 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:06,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:23:06,039 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:06,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 16:23:06,055 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:06,055 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:06,055 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 16:23:06,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:06,067 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-04-26 16:23:06,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:06,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:06,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:06,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:06,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:06,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:06,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:06,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:06,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:06,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:06,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:06,128 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:06,128 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17369 states and 63665 transitions. cyclomatic complexity: 48286 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:06,407 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17369 states and 63665 transitions. cyclomatic complexity: 48286. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 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 41022 states and 148399 transitions. Complement of second has 5 states. [2025-04-26 16:23:06,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-04-26 16:23:06,409 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 52 transitions. Stem has 16 letters. Loop has 5 letters. [2025-04-26 16:23:06,409 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:06,409 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:06,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:06,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:06,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:06,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:06,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:06,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:06,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:06,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:06,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:06,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:06,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:06,463 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:06,463 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17369 states and 63665 transitions. cyclomatic complexity: 48286 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:06,905 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17369 states and 63665 transitions. cyclomatic complexity: 48286. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 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 54941 states and 201300 transitions. Complement of second has 7 states. [2025-04-26 16:23:06,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-04-26 16:23:06,906 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 16 letters. Loop has 5 letters. [2025-04-26 16:23:06,906 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:06,906 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:06,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:06,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:06,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:06,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:06,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:06,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:06,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:06,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:06,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:06,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:06,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:06,966 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:06,967 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17369 states and 63665 transitions. cyclomatic complexity: 48286 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:07,197 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17369 states and 63665 transitions. cyclomatic complexity: 48286. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 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 39970 states and 146496 transitions. Complement of second has 5 states. [2025-04-26 16:23:07,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-26 16:23:07,198 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 16 letters. Loop has 5 letters. [2025-04-26 16:23:07,198 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:07,198 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 21 letters. Loop has 5 letters. [2025-04-26 16:23:07,198 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:07,198 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 16 letters. Loop has 10 letters. [2025-04-26 16:23:07,198 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:07,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39970 states and 146496 transitions. [2025-04-26 16:23:07,491 INFO L131 ngComponentsAnalysis]: Automaton has 271 accepting balls. 987 [2025-04-26 16:23:07,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39970 states to 20973 states and 74961 transitions. [2025-04-26 16:23:07,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4377 [2025-04-26 16:23:07,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5189 [2025-04-26 16:23:07,784 INFO L74 IsDeterministic]: Start isDeterministic. Operand 20973 states and 74961 transitions. [2025-04-26 16:23:07,784 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:07,784 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20973 states and 74961 transitions. [2025-04-26 16:23:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20973 states and 74961 transitions. [2025-04-26 16:23:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20973 to 9995. [2025-04-26 16:23:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9995 states, 9995 states have (on average 3.657528764382191) internal successors, (in total 36557), 9994 states have internal predecessors, (36557), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9995 states to 9995 states and 36557 transitions. [2025-04-26 16:23:08,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9995 states and 36557 transitions. [2025-04-26 16:23:08,005 INFO L438 stractBuchiCegarLoop]: Abstraction has 9995 states and 36557 transitions. [2025-04-26 16:23:08,005 INFO L340 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-04-26 16:23:08,005 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9995 states and 36557 transitions. [2025-04-26 16:23:08,042 INFO L131 ngComponentsAnalysis]: Automaton has 159 accepting balls. 683 [2025-04-26 16:23:08,042 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:08,042 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:08,043 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2025-04-26 16:23:08,043 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:08,043 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[99] L41-->L49: Formula: (<= v_N_2 v_i_4) InVars {i=v_i_4, N=v_N_2} OutVars{i=v_i_4, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:23:08,043 INFO L754 eck$LassoCheckResult]: Loop: "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:08,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,044 INFO L85 PathProgramCache]: Analyzing trace with hash -773956972, now seen corresponding path program 1 times [2025-04-26 16:23:08,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:08,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693878600] [2025-04-26 16:23:08,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:08,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:08,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:08,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:08,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:08,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:08,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:08,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:08,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash 129848075, now seen corresponding path program 7 times [2025-04-26 16:23:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:08,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635285233] [2025-04-26 16:23:08,051 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:23:08,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:08,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:08,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:08,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:08,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:08,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:08,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:08,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1067424856, now seen corresponding path program 1 times [2025-04-26 16:23:08,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:08,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682128950] [2025-04-26 16:23:08,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:08,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:08,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:08,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:08,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:08,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:08,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:08,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:08,388 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:08,388 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:08,388 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:08,388 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:08,388 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:08,389 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,389 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:08,389 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:08,389 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration14_Lasso [2025-04-26 16:23:08,389 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:08,389 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:08,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:08,650 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:08,650 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:08,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,652 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:23:08,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,666 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:08,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 16:23:08,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,673 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:23:08,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,688 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:08,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 16:23:08,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,695 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:23:08,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,710 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:08,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 16:23:08,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,717 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 16:23:08,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,733 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:08,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 16:23:08,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,740 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 16:23:08,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,756 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:08,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:08,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,763 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 16:23:08,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,779 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:08,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-04-26 16:23:08,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,787 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 16:23:08,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:08,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:08,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:08,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:08,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:08,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:08,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:08,804 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:08,811 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:08,811 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:23:08,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,813 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 16:23:08,814 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:08,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 16:23:08,830 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:08,830 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:08,830 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:23:08,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-04-26 16:23:08,839 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:08,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:08,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:08,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:08,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:08,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:08,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:08,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:08,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:08,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:08,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:08,896 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:08,896 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9995 states and 36557 transitions. cyclomatic complexity: 27697 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:08,962 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9995 states and 36557 transitions. cyclomatic complexity: 27697. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 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 10277 states and 37299 transitions. Complement of second has 4 states. [2025-04-26 16:23:08,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-26 16:23:08,963 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 10 letters. Loop has 5 letters. [2025-04-26 16:23:08,963 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:08,964 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 16:23:08,964 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:08,964 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 10 letters. Loop has 10 letters. [2025-04-26 16:23:08,964 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:08,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10277 states and 37299 transitions. [2025-04-26 16:23:09,036 INFO L131 ngComponentsAnalysis]: Automaton has 154 accepting balls. 602 [2025-04-26 16:23:09,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10277 states to 9877 states and 35830 transitions. [2025-04-26 16:23:09,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1910 [2025-04-26 16:23:09,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1910 [2025-04-26 16:23:09,091 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9877 states and 35830 transitions. [2025-04-26 16:23:09,091 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:09,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9877 states and 35830 transitions. [2025-04-26 16:23:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9877 states and 35830 transitions. [2025-04-26 16:23:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9877 to 9698. [2025-04-26 16:23:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9698 states, 9698 states have (on average 3.6279645287688185) internal successors, (in total 35184), 9697 states have internal predecessors, (35184), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9698 states to 9698 states and 35184 transitions. [2025-04-26 16:23:09,318 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9698 states and 35184 transitions. [2025-04-26 16:23:09,318 INFO L438 stractBuchiCegarLoop]: Abstraction has 9698 states and 35184 transitions. [2025-04-26 16:23:09,319 INFO L340 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-04-26 16:23:09,319 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9698 states and 35184 transitions. [2025-04-26 16:23:09,351 INFO L131 ngComponentsAnalysis]: Automaton has 144 accepting balls. 496 [2025-04-26 16:23:09,352 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:09,352 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:09,352 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1] [2025-04-26 16:23:09,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:09,353 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" [2025-04-26 16:23:09,353 INFO L754 eck$LassoCheckResult]: Loop: "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:09,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,355 INFO L85 PathProgramCache]: Analyzing trace with hash -773956971, now seen corresponding path program 1 times [2025-04-26 16:23:09,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169229868] [2025-04-26 16:23:09,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:09,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:09,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:09,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:09,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:09,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash 129848075, now seen corresponding path program 8 times [2025-04-26 16:23:09,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325981735] [2025-04-26 16:23:09,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:09,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:09,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:09,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:09,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,370 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:09,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:09,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1096054007, now seen corresponding path program 4 times [2025-04-26 16:23:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416885107] [2025-04-26 16:23:09,373 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,374 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-26 16:23:09,376 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:09,376 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:09,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:09,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:09,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,585 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:09,585 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:09,585 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:09,586 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:09,586 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:09,586 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,586 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:09,586 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:09,586 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration15_Lasso [2025-04-26 16:23:09,586 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:09,586 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:09,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,832 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:09,832 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:09,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,834 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 16:23:09,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,848 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:09,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 16:23:09,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,856 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 16:23:09,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,870 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:09,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:09,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,878 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 16:23:09,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,893 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:09,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-04-26 16:23:09,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,900 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 16:23:09,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,915 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:09,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-04-26 16:23:09,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,922 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 16:23:09,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,935 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:09,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-04-26 16:23:09,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,943 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-04-26 16:23:09,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,957 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:09,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-04-26 16:23:09,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,967 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-04-26 16:23:09,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,983 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:09,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-04-26 16:23:09,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,990 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-04-26 16:23:09,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,005 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-04-26 16:23:10,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,013 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-04-26 16:23:10,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,030 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:10,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,037 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-04-26 16:23:10,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,053 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:10,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,061 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-04-26 16:23:10,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,078 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:10,083 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:10,083 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:23:10,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,085 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-04-26 16:23:10,087 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:10,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-04-26 16:23:10,102 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:10,102 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:10,102 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 16:23:10,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-04-26 16:23:10,113 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:10,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:10,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:10,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:10,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:10,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:10,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:10,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:10,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:10,163 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:10,163 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9698 states and 35184 transitions. cyclomatic complexity: 26606 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,216 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9698 states and 35184 transitions. cyclomatic complexity: 26606. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 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 9722 states and 35238 transitions. Complement of second has 5 states. [2025-04-26 16:23:10,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-04-26 16:23:10,217 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 5 letters. [2025-04-26 16:23:10,217 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,217 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:10,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:10,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:10,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:10,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:10,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:10,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:10,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:10,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:10,271 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:10,271 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9698 states and 35184 transitions. cyclomatic complexity: 26606 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,327 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9698 states and 35184 transitions. cyclomatic complexity: 26606. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 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 9722 states and 35238 transitions. Complement of second has 5 states. [2025-04-26 16:23:10,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-04-26 16:23:10,328 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 5 letters. [2025-04-26 16:23:10,328 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,328 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:10,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:10,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:10,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:10,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:10,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:10,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:10,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:10,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:10,369 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:10,369 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9698 states and 35184 transitions. cyclomatic complexity: 26606 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,602 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9698 states and 35184 transitions. cyclomatic complexity: 26606. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 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 34002 states and 118159 transitions. Complement of second has 7 states. [2025-04-26 16:23:10,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-04-26 16:23:10,604 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 57 transitions. Stem has 10 letters. Loop has 5 letters. [2025-04-26 16:23:10,604 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,604 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 57 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 16:23:10,604 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,604 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 57 transitions. Stem has 10 letters. Loop has 10 letters. [2025-04-26 16:23:10,605 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34002 states and 118159 transitions. [2025-04-26 16:23:10,819 INFO L131 ngComponentsAnalysis]: Automaton has 168 accepting balls. 434 [2025-04-26 16:23:11,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34002 states to 26832 states and 90134 transitions. [2025-04-26 16:23:11,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3115 [2025-04-26 16:23:11,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3498 [2025-04-26 16:23:11,094 INFO L74 IsDeterministic]: Start isDeterministic. Operand 26832 states and 90134 transitions. [2025-04-26 16:23:11,094 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:11,094 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26832 states and 90134 transitions. [2025-04-26 16:23:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26832 states and 90134 transitions. [2025-04-26 16:23:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26832 to 13543. [2025-04-26 16:23:11,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13543 states, 13543 states have (on average 3.6935686332422653) internal successors, (in total 50022), 13542 states have internal predecessors, (50022), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13543 states to 13543 states and 50022 transitions. [2025-04-26 16:23:11,409 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13543 states and 50022 transitions. [2025-04-26 16:23:11,409 INFO L438 stractBuchiCegarLoop]: Abstraction has 13543 states and 50022 transitions. [2025-04-26 16:23:11,409 INFO L340 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-04-26 16:23:11,409 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13543 states and 50022 transitions. [2025-04-26 16:23:11,461 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 224 [2025-04-26 16:23:11,461 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:11,461 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:11,462 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2025-04-26 16:23:11,462 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:11,462 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:11,462 INFO L754 eck$LassoCheckResult]: Loop: "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:11,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash -773956965, now seen corresponding path program 1 times [2025-04-26 16:23:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:11,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579260453] [2025-04-26 16:23:11,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:11,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:11,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:11,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:11,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:11,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:11,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:11,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:11,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:11,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:11,471 INFO L85 PathProgramCache]: Analyzing trace with hash 131725895, now seen corresponding path program 9 times [2025-04-26 16:23:11,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:11,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079534435] [2025-04-26 16:23:11,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:11,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:11,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:11,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:11,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:11,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:11,476 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:11,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:11,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:11,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:11,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:11,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:11,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1269706733, now seen corresponding path program 5 times [2025-04-26 16:23:11,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:11,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126923797] [2025-04-26 16:23:11,478 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:11,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:11,481 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 3 equivalence classes. [2025-04-26 16:23:11,484 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:11,484 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-26 16:23:11,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:11,484 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:11,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:11,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:11,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:11,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:11,696 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:11,696 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:11,696 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:11,696 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:11,696 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:11,697 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,697 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:11,697 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:11,697 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration16_Lasso [2025-04-26 16:23:11,697 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:11,697 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:11,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,958 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:11,958 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:11,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,961 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-04-26 16:23:11,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:11,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:11,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:11,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:11,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:11,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:11,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:11,978 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:11,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-04-26 16:23:11,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,986 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-04-26 16:23:11,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:11,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:11,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:11,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:11,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:11,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:11,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:12,002 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:12,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:12,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:12,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:12,011 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:12,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-04-26 16:23:12,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:12,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:12,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:12,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:12,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:12,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:12,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:12,028 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:12,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-04-26 16:23:12,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:12,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:12,035 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:12,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-04-26 16:23:12,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:12,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:12,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:12,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:12,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:12,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:12,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:12,055 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:12,060 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:12,060 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:23:12,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:12,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:12,062 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:12,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-04-26 16:23:12,064 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:12,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-04-26 16:23:12,085 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:12,085 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:12,085 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 16:23:12,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-04-26 16:23:12,094 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:12,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:12,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:12,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:12,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:12,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:12,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:12,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:12,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:12,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:12,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:12,143 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:12,143 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13543 states and 50022 transitions. cyclomatic complexity: 37632 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:12,334 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13543 states and 50022 transitions. cyclomatic complexity: 37632. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 31307 states and 111931 transitions. Complement of second has 5 states. [2025-04-26 16:23:12,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-26 16:23:12,335 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 10 letters. Loop has 5 letters. [2025-04-26 16:23:12,335 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:12,335 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 16:23:12,336 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:12,336 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 10 letters. Loop has 10 letters. [2025-04-26 16:23:12,336 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:12,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31307 states and 111931 transitions. [2025-04-26 16:23:12,598 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 322 [2025-04-26 16:23:12,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31307 states to 23672 states and 82497 transitions. [2025-04-26 16:23:12,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2649 [2025-04-26 16:23:12,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2700 [2025-04-26 16:23:12,764 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23672 states and 82497 transitions. [2025-04-26 16:23:12,764 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:12,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23672 states and 82497 transitions. [2025-04-26 16:23:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23672 states and 82497 transitions. [2025-04-26 16:23:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23672 to 13930. [2025-04-26 16:23:13,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13930 states, 13930 states have (on average 3.689734386216798) internal successors, (in total 51398), 13929 states have internal predecessors, (51398), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13930 states to 13930 states and 51398 transitions. [2025-04-26 16:23:13,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13930 states and 51398 transitions. [2025-04-26 16:23:13,244 INFO L438 stractBuchiCegarLoop]: Abstraction has 13930 states and 51398 transitions. [2025-04-26 16:23:13,244 INFO L340 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-04-26 16:23:13,244 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13930 states and 51398 transitions. [2025-04-26 16:23:13,298 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 224 [2025-04-26 16:23:13,298 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:13,298 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:13,299 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2025-04-26 16:23:13,299 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:13,299 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" [2025-04-26 16:23:13,299 INFO L754 eck$LassoCheckResult]: Loop: "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" [2025-04-26 16:23:13,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:13,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1777140759, now seen corresponding path program 1 times [2025-04-26 16:23:13,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:13,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936060703] [2025-04-26 16:23:13,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:13,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:13,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:13,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:13,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:13,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:13,303 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:13,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:13,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:13,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:13,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:13,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:13,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:13,306 INFO L85 PathProgramCache]: Analyzing trace with hash 132680015, now seen corresponding path program 10 times [2025-04-26 16:23:13,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:13,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39936966] [2025-04-26 16:23:13,306 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:13,307 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 16:23:13,308 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:13,308 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:13,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:13,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:13,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:13,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:13,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:13,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:13,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:13,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1022844167, now seen corresponding path program 6 times [2025-04-26 16:23:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:13,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019807703] [2025-04-26 16:23:13,309 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:13,311 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 3 equivalence classes. [2025-04-26 16:23:13,313 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:13,313 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-26 16:23:13,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:13,313 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:13,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:13,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:13,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:13,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:13,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:13,512 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:13,513 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:13,513 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:13,513 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:13,513 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:13,513 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:13,513 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:13,513 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:13,513 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration17_Lasso [2025-04-26 16:23:13,513 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:13,513 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:13,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:13,700 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:13,700 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:13,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:13,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:13,702 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:13,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-04-26 16:23:13,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:13,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:13,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:13,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:13,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:13,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:13,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:13,717 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:13,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-04-26 16:23:13,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:13,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:13,725 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:13,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-04-26 16:23:13,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:13,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:13,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:13,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:13,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:13,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:13,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:13,741 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:13,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-04-26 16:23:13,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:13,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:13,748 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:13,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-04-26 16:23:13,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:13,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:13,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:13,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:13,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:13,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:13,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:13,770 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:13,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-04-26 16:23:13,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:13,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:13,779 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:13,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-04-26 16:23:13,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:13,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:13,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:13,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:13,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:13,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:13,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:13,795 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:13,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-04-26 16:23:13,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:13,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:13,826 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:13,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-04-26 16:23:13,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:13,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:13,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:13,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:13,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:13,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:13,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:13,844 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:13,851 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:23:13,851 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:23:13,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:13,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:13,853 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:13,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-04-26 16:23:13,856 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:13,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:13,873 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:13,873 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:13,873 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 16:23:13,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:13,882 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:23:13,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:13,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:13,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:13,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:13,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:13,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:13,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:13,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:13,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:13,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:13,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:13,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:13,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:13,920 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:23:13,920 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13930 states and 51398 transitions. cyclomatic complexity: 38638 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:14,190 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13930 states and 51398 transitions. cyclomatic complexity: 38638. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 31958 states and 114298 transitions. Complement of second has 5 states. [2025-04-26 16:23:14,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-26 16:23:14,191 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 11 letters. Loop has 5 letters. [2025-04-26 16:23:14,191 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:14,191 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 16 letters. Loop has 5 letters. [2025-04-26 16:23:14,191 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:14,191 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 11 letters. Loop has 10 letters. [2025-04-26 16:23:14,191 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:14,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31958 states and 114298 transitions. [2025-04-26 16:23:14,419 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 322 [2025-04-26 16:23:14,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31958 states to 24043 states and 83805 transitions. [2025-04-26 16:23:14,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2668 [2025-04-26 16:23:14,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2719 [2025-04-26 16:23:14,555 INFO L74 IsDeterministic]: Start isDeterministic. Operand 24043 states and 83805 transitions. [2025-04-26 16:23:14,555 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:14,555 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24043 states and 83805 transitions. [2025-04-26 16:23:14,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24043 states and 83805 transitions. [2025-04-26 16:23:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24043 to 13987. [2025-04-26 16:23:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13987 states, 13987 states have (on average 3.687424036605419) internal successors, (in total 51576), 13986 states have internal predecessors, (51576), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 51576 transitions. [2025-04-26 16:23:14,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13987 states and 51576 transitions. [2025-04-26 16:23:14,996 INFO L438 stractBuchiCegarLoop]: Abstraction has 13987 states and 51576 transitions. [2025-04-26 16:23:14,996 INFO L340 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-04-26 16:23:14,996 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13987 states and 51576 transitions. [2025-04-26 16:23:15,051 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 224 [2025-04-26 16:23:15,051 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:15,051 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:15,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:15,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:15,052 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:15,052 INFO L754 eck$LassoCheckResult]: Loop: "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:15,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1423419299, now seen corresponding path program 2 times [2025-04-26 16:23:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:15,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328044552] [2025-04-26 16:23:15,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:15,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:15,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-26 16:23:15,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:15,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:15,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:15,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:15,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:15,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:15,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash 133628585, now seen corresponding path program 11 times [2025-04-26 16:23:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:15,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303522662] [2025-04-26 16:23:15,061 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:15,062 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:15,062 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:15,062 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:15,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:15,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:15,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:15,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:15,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:15,064 INFO L85 PathProgramCache]: Analyzing trace with hash 792776775, now seen corresponding path program 7 times [2025-04-26 16:23:15,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:15,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930669666] [2025-04-26 16:23:15,064 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:23:15,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:15,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:15,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:15,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:15,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:15,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:15,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:15,297 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:15,297 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:15,297 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:15,297 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:15,297 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:15,297 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,297 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:15,297 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:15,297 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration18_Lasso [2025-04-26 16:23:15,297 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:15,297 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:15,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:15,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:15,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:15,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:15,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:15,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:15,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:15,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:15,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:15,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:15,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:15,503 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:15,503 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:15,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:15,505 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:15,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-04-26 16:23:15,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:15,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:15,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:15,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:15,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:15,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:15,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:15,520 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:15,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-04-26 16:23:15,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:15,529 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:15,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-04-26 16:23:15,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:15,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:15,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:15,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:15,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:15,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:15,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:15,546 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:15,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-04-26 16:23:15,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:15,553 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:15,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-04-26 16:23:15,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:23:15,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:15,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:15,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:15,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:15,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:15,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:15,568 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:15,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-04-26 16:23:15,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:15,575 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:15,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-04-26 16:23:15,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:15,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:15,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:15,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:15,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:15,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:15,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:15,590 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:15,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-04-26 16:23:15,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:15,597 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:15,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-04-26 16:23:15,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:23:15,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:15,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:15,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:15,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:15,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:15,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:15,611 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:15,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-04-26 16:23:15,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:15,619 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:15,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-04-26 16:23:15,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:15,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:15,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:15,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:15,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:15,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:15,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:15,636 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:15,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-04-26 16:23:15,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:15,645 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:15,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-04-26 16:23:15,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:15,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:15,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:15,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:15,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:15,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:15,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:15,662 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:15,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-04-26 16:23:15,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:15,669 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:15,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-04-26 16:23:15,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:15,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:15,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:15,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:15,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:15,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:15,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:15,683 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:15,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-04-26 16:23:15,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:15,690 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:15,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-04-26 16:23:15,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:15,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:15,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:15,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:15,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:15,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:15,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:15,705 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:15,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-04-26 16:23:15,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:15,712 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:15,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-04-26 16:23:15,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:15,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:15,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:15,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:15,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:15,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:15,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:15,731 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:15,736 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:15,736 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:23:15,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:15,737 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:15,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-04-26 16:23:15,743 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:15,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:15,758 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:15,758 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:15,758 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 16:23:15,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-04-26 16:23:15,766 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:23:15,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:15,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:15,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:15,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:15,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:15,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:15,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:15,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:15,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:15,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:15,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:15,819 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:15,819 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13987 states and 51576 transitions. cyclomatic complexity: 38762 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:16,156 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13987 states and 51576 transitions. cyclomatic complexity: 38762. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 38030 states and 137261 transitions. Complement of second has 5 states. [2025-04-26 16:23:16,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-04-26 16:23:16,157 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 14 letters. Loop has 5 letters. [2025-04-26 16:23:16,157 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:16,157 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 19 letters. Loop has 5 letters. [2025-04-26 16:23:16,157 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:16,157 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 14 letters. Loop has 10 letters. [2025-04-26 16:23:16,157 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:16,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38030 states and 137261 transitions. [2025-04-26 16:23:16,492 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 322 [2025-04-26 16:23:16,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38030 states to 28297 states and 97863 transitions. [2025-04-26 16:23:16,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2808 [2025-04-26 16:23:16,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2872 [2025-04-26 16:23:16,703 INFO L74 IsDeterministic]: Start isDeterministic. Operand 28297 states and 97863 transitions. [2025-04-26 16:23:16,703 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:16,703 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28297 states and 97863 transitions. [2025-04-26 16:23:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28297 states and 97863 transitions. [2025-04-26 16:23:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28297 to 14319. [2025-04-26 16:23:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14319 states, 14319 states have (on average 3.688874921433061) internal successors, (in total 52821), 14318 states have internal predecessors, (52821), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14319 states to 14319 states and 52821 transitions. [2025-04-26 16:23:17,253 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14319 states and 52821 transitions. [2025-04-26 16:23:17,253 INFO L438 stractBuchiCegarLoop]: Abstraction has 14319 states and 52821 transitions. [2025-04-26 16:23:17,253 INFO L340 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-04-26 16:23:17,253 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14319 states and 52821 transitions. [2025-04-26 16:23:17,305 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 224 [2025-04-26 16:23:17,305 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:17,305 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:17,305 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:17,305 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:17,306 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" [2025-04-26 16:23:17,306 INFO L754 eck$LassoCheckResult]: Loop: "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" [2025-04-26 16:23:17,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1176330999, now seen corresponding path program 1 times [2025-04-26 16:23:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:17,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020125972] [2025-04-26 16:23:17,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:17,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:17,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:17,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:17,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:17,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:17,311 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:17,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:17,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:17,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:17,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:17,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:17,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:17,320 INFO L85 PathProgramCache]: Analyzing trace with hash 134405105, now seen corresponding path program 12 times [2025-04-26 16:23:17,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:17,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323200928] [2025-04-26 16:23:17,320 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:17,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:17,322 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:17,322 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:17,322 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:23:17,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:17,323 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:17,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:17,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:17,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:17,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:17,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:17,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:17,325 INFO L85 PathProgramCache]: Analyzing trace with hash -356851013, now seen corresponding path program 8 times [2025-04-26 16:23:17,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:17,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938919059] [2025-04-26 16:23:17,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:17,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:17,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-26 16:23:17,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:23:17,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:17,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:17,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:17,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:23:17,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:23:17,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:17,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:17,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:17,577 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:17,577 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:17,577 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:17,577 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:17,577 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:17,577 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,577 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:17,577 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:17,577 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration19_Lasso [2025-04-26 16:23:17,577 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:17,577 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:17,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,794 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:17,794 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:17,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,796 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:17,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-04-26 16:23:17,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:17,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,814 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-04-26 16:23:17,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,823 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:17,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-04-26 16:23:17,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:17,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,841 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:17,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,849 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:17,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-04-26 16:23:17,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:17,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,866 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-04-26 16:23:17,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,875 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:17,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-04-26 16:23:17,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:17,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,892 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-04-26 16:23:17,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,902 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:17,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-04-26 16:23:17,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:17,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,916 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-04-26 16:23:17,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,923 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:17,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-04-26 16:23:17,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:17,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,937 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-04-26 16:23:17,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,945 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:17,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-04-26 16:23:17,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:17,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,959 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:17,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,966 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:17,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-04-26 16:23:17,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:23:17,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,980 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-04-26 16:23:17,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,987 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:17,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-04-26 16:23:17,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:17,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:18,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:18,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:18,004 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:18,009 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:18,009 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:18,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:18,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:18,011 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:18,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-04-26 16:23:18,013 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:18,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-04-26 16:23:18,028 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:18,028 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:18,028 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:23:18,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-04-26 16:23:18,037 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:23:18,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:18,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:18,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:18,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:18,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:18,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:18,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:18,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:18,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:18,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:18,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:18,089 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:18,089 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14319 states and 52821 transitions. cyclomatic complexity: 39683 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:18,412 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14319 states and 52821 transitions. cyclomatic complexity: 39683. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 43248 states and 160028 transitions. Complement of second has 5 states. [2025-04-26 16:23:18,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-26 16:23:18,413 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 16:23:18,414 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:18,414 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 20 letters. Loop has 5 letters. [2025-04-26 16:23:18,414 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:18,414 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 15 letters. Loop has 10 letters. [2025-04-26 16:23:18,414 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:18,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43248 states and 160028 transitions. [2025-04-26 16:23:18,723 INFO L131 ngComponentsAnalysis]: Automaton has 119 accepting balls. 336 [2025-04-26 16:23:19,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43248 states to 33601 states and 116572 transitions. [2025-04-26 16:23:19,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3591 [2025-04-26 16:23:19,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3752 [2025-04-26 16:23:19,143 INFO L74 IsDeterministic]: Start isDeterministic. Operand 33601 states and 116572 transitions. [2025-04-26 16:23:19,143 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:19,143 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33601 states and 116572 transitions. [2025-04-26 16:23:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33601 states and 116572 transitions. [2025-04-26 16:23:19,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33601 to 15697. [2025-04-26 16:23:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15697 states, 15697 states have (on average 3.7594444798369113) internal successors, (in total 59012), 15696 states have internal predecessors, (59012), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15697 states to 15697 states and 59012 transitions. [2025-04-26 16:23:19,488 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15697 states and 59012 transitions. [2025-04-26 16:23:19,489 INFO L438 stractBuchiCegarLoop]: Abstraction has 15697 states and 59012 transitions. [2025-04-26 16:23:19,489 INFO L340 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-04-26 16:23:19,489 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15697 states and 59012 transitions. [2025-04-26 16:23:19,544 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 224 [2025-04-26 16:23:19,544 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:19,544 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:19,544 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:19,544 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:19,545 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[127] L96-->L76: 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:23:19,545 INFO L754 eck$LassoCheckResult]: Loop: "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" [2025-04-26 16:23:19,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2106529238, now seen corresponding path program 1 times [2025-04-26 16:23:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:19,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742450936] [2025-04-26 16:23:19,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:19,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:19,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:19,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:19,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:19,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:19,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:19,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:19,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash 134405105, now seen corresponding path program 13 times [2025-04-26 16:23:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:19,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832157767] [2025-04-26 16:23:19,556 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:23:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:19,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:19,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:19,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:19,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:19,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:19,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:19,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash -317643972, now seen corresponding path program 1 times [2025-04-26 16:23:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:19,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100478668] [2025-04-26 16:23:19,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:19,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:19,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:19,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,566 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:19,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:19,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:19,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:19,986 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:19,986 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:19,986 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:19,986 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:19,986 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:19,986 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:19,986 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:19,986 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:19,986 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration20_Lasso [2025-04-26 16:23:19,986 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:19,986 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:19,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:20,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:20,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:20,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:20,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:20,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:20,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:20,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:20,247 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:20,247 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:20,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:20,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:20,249 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:20,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-04-26 16:23:20,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:20,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:20,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:20,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:20,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:20,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:20,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:20,264 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:20,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-04-26 16:23:20,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:20,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:20,271 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:20,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-04-26 16:23:20,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:20,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:20,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:20,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:20,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:20,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:20,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:20,293 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:20,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-04-26 16:23:20,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:20,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:20,329 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:20,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-04-26 16:23:20,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:20,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:20,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:20,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:20,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:20,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:20,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:20,361 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:20,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-04-26 16:23:20,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:20,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:20,369 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:20,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-04-26 16:23:20,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:20,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:20,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:20,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:20,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:20,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:20,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:20,383 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:20,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:20,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:20,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:20,391 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:20,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-04-26 16:23:20,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:20,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:20,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:20,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:20,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:20,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:20,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:20,405 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:20,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-04-26 16:23:20,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:20,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:20,413 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:20,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-04-26 16:23:20,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:20,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:20,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:20,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:20,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:20,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:20,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:20,427 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:20,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-04-26 16:23:20,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:20,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:20,435 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:20,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-04-26 16:23:20,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:20,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:20,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:20,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:20,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:20,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:20,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:20,449 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:20,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-04-26 16:23:20,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:20,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:20,457 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:20,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-04-26 16:23:20,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:20,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:20,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:20,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:20,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:20,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:20,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:20,472 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:20,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-04-26 16:23:20,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:20,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:20,479 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:20,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-04-26 16:23:20,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:20,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:20,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:20,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:20,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:20,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:20,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:20,497 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:20,501 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:20,502 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:20,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:20,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:20,503 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:20,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-04-26 16:23:20,505 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:20,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:20,521 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:20,521 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:20,521 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:23:20,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-04-26 16:23:20,529 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:20,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:20,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:20,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:20,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:20,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:20,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:20,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:20,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:20,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:20,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:20,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:20,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:20,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:20,583 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:20,583 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15697 states and 59012 transitions. cyclomatic complexity: 44592 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:20,915 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15697 states and 59012 transitions. cyclomatic complexity: 44592. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 47130 states and 174470 transitions. Complement of second has 5 states. [2025-04-26 16:23:20,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-04-26 16:23:20,916 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 16 letters. Loop has 5 letters. [2025-04-26 16:23:20,916 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:20,916 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 21 letters. Loop has 5 letters. [2025-04-26 16:23:20,916 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:20,916 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 16 letters. Loop has 10 letters. [2025-04-26 16:23:20,916 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:20,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47130 states and 174470 transitions. [2025-04-26 16:23:21,411 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 322 [2025-04-26 16:23:21,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47130 states to 36181 states and 126059 transitions. [2025-04-26 16:23:21,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3571 [2025-04-26 16:23:21,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3635 [2025-04-26 16:23:21,641 INFO L74 IsDeterministic]: Start isDeterministic. Operand 36181 states and 126059 transitions. [2025-04-26 16:23:21,641 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:21,641 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36181 states and 126059 transitions. [2025-04-26 16:23:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36181 states and 126059 transitions. [2025-04-26 16:23:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36181 to 15806. [2025-04-26 16:23:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15806 states, 15806 states have (on average 3.768189295204353) internal successors, (in total 59560), 15805 states have internal predecessors, (59560), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15806 states to 15806 states and 59560 transitions. [2025-04-26 16:23:22,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15806 states and 59560 transitions. [2025-04-26 16:23:22,207 INFO L438 stractBuchiCegarLoop]: Abstraction has 15806 states and 59560 transitions. [2025-04-26 16:23:22,207 INFO L340 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-04-26 16:23:22,207 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15806 states and 59560 transitions. [2025-04-26 16:23:22,280 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 224 [2025-04-26 16:23:22,280 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:22,280 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:22,281 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:22,281 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:22,281 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:22,281 INFO L754 eck$LassoCheckResult]: Loop: "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:23:22,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:22,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2106529222, now seen corresponding path program 9 times [2025-04-26 16:23:22,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:22,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340012305] [2025-04-26 16:23:22,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:22,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:22,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 4 equivalence classes. [2025-04-26 16:23:22,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:22,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-26 16:23:22,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:22,289 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:22,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:22,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:22,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:22,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:22,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:22,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:22,293 INFO L85 PathProgramCache]: Analyzing trace with hash 129848075, now seen corresponding path program 14 times [2025-04-26 16:23:22,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:22,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305229803] [2025-04-26 16:23:22,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:22,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:22,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:22,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:22,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:22,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:22,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:22,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:22,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:22,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:22,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:22,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:22,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:22,298 INFO L85 PathProgramCache]: Analyzing trace with hash -780267418, now seen corresponding path program 10 times [2025-04-26 16:23:22,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:22,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508031339] [2025-04-26 16:23:22,298 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:22,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:22,300 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-26 16:23:22,308 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:22,308 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:22,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:22,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:22,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:22,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:22,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:22,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:22,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:22,581 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:22,581 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:22,581 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:22,581 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:22,581 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:22,581 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:22,581 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:22,581 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:22,581 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration21_Lasso [2025-04-26 16:23:22,581 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:22,581 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:22,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:22,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:22,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:22,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:22,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:22,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:22,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:22,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:22,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:22,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:22,864 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:22,864 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:22,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:22,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:22,866 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:22,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-04-26 16:23:22,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:22,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:22,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:22,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:22,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:22,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:22,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:22,880 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:22,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-04-26 16:23:22,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:22,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:22,887 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:22,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-04-26 16:23:22,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:22,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:22,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:22,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:22,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:22,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:22,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:22,901 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:22,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-04-26 16:23:22,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:22,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:22,908 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:22,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-04-26 16:23:22,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:22,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:22,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:22,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:22,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:22,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:22,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:22,923 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:22,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-04-26 16:23:22,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:22,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:22,931 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:22,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-04-26 16:23:22,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:22,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:22,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:22,942 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:22,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:22,951 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:23:22,951 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:22,969 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:22,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-04-26 16:23:22,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:22,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:22,976 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:22,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-04-26 16:23:22,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:22,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:22,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:22,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:22,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:22,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:22,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:22,995 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:22,999 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:22,999 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:22,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:23,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:23,001 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:23,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-04-26 16:23:23,002 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:23,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-04-26 16:23:23,018 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:23,019 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:23,019 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 16:23:23,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:23,031 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-04-26 16:23:23,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:23,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:23,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:23,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:23,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:23,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:23,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:23,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:23,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:23,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:23,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:23,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:23,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:23,081 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:23,081 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15806 states and 59560 transitions. cyclomatic complexity: 45035 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:23,403 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15806 states and 59560 transitions. cyclomatic complexity: 45035. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 46555 states and 174736 transitions. Complement of second has 5 states. [2025-04-26 16:23:23,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-26 16:23:23,404 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 16 letters. Loop has 5 letters. [2025-04-26 16:23:23,404 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:23,404 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 21 letters. Loop has 5 letters. [2025-04-26 16:23:23,404 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:23,404 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 16 letters. Loop has 10 letters. [2025-04-26 16:23:23,404 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:23,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46555 states and 174736 transitions. [2025-04-26 16:23:23,774 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 350 [2025-04-26 16:23:24,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46555 states to 37028 states and 130965 transitions. [2025-04-26 16:23:24,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4045 [2025-04-26 16:23:24,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4218 [2025-04-26 16:23:24,227 INFO L74 IsDeterministic]: Start isDeterministic. Operand 37028 states and 130965 transitions. [2025-04-26 16:23:24,227 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:24,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37028 states and 130965 transitions. [2025-04-26 16:23:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37028 states and 130965 transitions. [2025-04-26 16:23:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37028 to 16945. [2025-04-26 16:23:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16945 states, 16945 states have (on average 3.8343464148716437) internal successors, (in total 64973), 16944 states have internal predecessors, (64973), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16945 states to 16945 states and 64973 transitions. [2025-04-26 16:23:24,596 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16945 states and 64973 transitions. [2025-04-26 16:23:24,596 INFO L438 stractBuchiCegarLoop]: Abstraction has 16945 states and 64973 transitions. [2025-04-26 16:23:24,596 INFO L340 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-04-26 16:23:24,596 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16945 states and 64973 transitions. [2025-04-26 16:23:24,793 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 224 [2025-04-26 16:23:24,793 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:24,793 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:24,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:24,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:24,794 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:24,794 INFO L754 eck$LassoCheckResult]: Loop: "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:24,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash 877903988, now seen corresponding path program 11 times [2025-04-26 16:23:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:24,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693154093] [2025-04-26 16:23:24,795 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:24,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:24,797 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 4 equivalence classes. [2025-04-26 16:23:24,803 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:24,803 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-26 16:23:24,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:24,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:24,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:24,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:24,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash 131725895, now seen corresponding path program 15 times [2025-04-26 16:23:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:24,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204524439] [2025-04-26 16:23:24,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:24,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:24,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:24,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:24,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:24,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,813 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:24,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:24,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:24,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:24,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash -165967436, now seen corresponding path program 12 times [2025-04-26 16:23:24,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:24,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664087598] [2025-04-26 16:23:24,816 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:24,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:24,818 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 4 equivalence classes. [2025-04-26 16:23:24,827 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:23:24,827 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-26 16:23:24,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:24,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:23:24,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:23:24,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:25,146 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:25,146 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:25,146 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:25,146 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:25,146 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:25,146 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:25,146 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:25,147 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:25,147 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration22_Lasso [2025-04-26 16:23:25,147 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:25,147 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:25,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:25,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:25,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:25,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:25,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:25,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:25,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:25,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:25,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:25,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:25,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:25,400 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:25,400 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:25,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:25,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:25,404 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:25,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-04-26 16:23:25,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:25,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:25,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:25,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:25,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:25,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:25,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:25,423 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:25,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:25,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:25,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:25,432 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:25,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-04-26 16:23:25,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:25,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:25,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:25,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:25,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:25,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:25,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:25,452 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:25,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:25,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:25,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:25,461 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:25,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:25,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-04-26 16:23:25,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:25,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:25,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:25,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:25,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:25,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:25,479 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:25,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2025-04-26 16:23:25,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:25,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:25,486 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:25,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-04-26 16:23:25,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:25,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:25,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:25,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:25,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:25,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:25,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:25,503 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:25,509 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:25,509 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:25,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:25,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:25,511 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:25,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-04-26 16:23:25,512 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:25,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-04-26 16:23:25,528 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:25,528 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:25,528 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 16:23:25,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:25,536 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:23:25,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:25,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:25,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:25,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:25,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:25,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:25,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:25,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:25,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:25,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:25,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:25,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:25,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:25,584 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:25,584 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16945 states and 64973 transitions. cyclomatic complexity: 49396 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:25,794 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16945 states and 64973 transitions. cyclomatic complexity: 49396. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 31583 states and 114615 transitions. Complement of second has 5 states. [2025-04-26 16:23:25,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-26 16:23:25,795 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 17 letters. Loop has 5 letters. [2025-04-26 16:23:25,796 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:25,796 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:25,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:25,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:25,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:25,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:25,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:25,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:25,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:25,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:25,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:25,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:25,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:25,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:25,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:25,855 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:25,856 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16945 states and 64973 transitions. cyclomatic complexity: 49396 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:26,335 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16945 states and 64973 transitions. cyclomatic complexity: 49396. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 66429 states and 249145 transitions. Complement of second has 7 states. [2025-04-26 16:23:26,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-04-26 16:23:26,336 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 17 letters. Loop has 5 letters. [2025-04-26 16:23:26,336 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:26,336 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 22 letters. Loop has 5 letters. [2025-04-26 16:23:26,337 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:26,337 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 17 letters. Loop has 10 letters. [2025-04-26 16:23:26,337 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:26,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66429 states and 249145 transitions. [2025-04-26 16:23:26,849 INFO L131 ngComponentsAnalysis]: Automaton has 154 accepting balls. 406 [2025-04-26 16:23:27,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66429 states to 58997 states and 215286 transitions. [2025-04-26 16:23:27,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7191 [2025-04-26 16:23:27,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7410 [2025-04-26 16:23:27,595 INFO L74 IsDeterministic]: Start isDeterministic. Operand 58997 states and 215286 transitions. [2025-04-26 16:23:27,595 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:27,596 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58997 states and 215286 transitions. [2025-04-26 16:23:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58997 states and 215286 transitions. [2025-04-26 16:23:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58997 to 40436. [2025-04-26 16:23:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40436 states, 40436 states have (on average 3.788257987931546) internal successors, (in total 153182), 40435 states have internal predecessors, (153182), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40436 states to 40436 states and 153182 transitions. [2025-04-26 16:23:28,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40436 states and 153182 transitions. [2025-04-26 16:23:28,524 INFO L438 stractBuchiCegarLoop]: Abstraction has 40436 states and 153182 transitions. [2025-04-26 16:23:28,524 INFO L340 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-04-26 16:23:28,524 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40436 states and 153182 transitions. [2025-04-26 16:23:28,705 INFO L131 ngComponentsAnalysis]: Automaton has 91 accepting balls. 280 [2025-04-26 16:23:28,705 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:28,705 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:28,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:28,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:28,706 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:28,706 INFO L754 eck$LassoCheckResult]: Loop: "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:28,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1920443046, now seen corresponding path program 13 times [2025-04-26 16:23:28,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531800803] [2025-04-26 16:23:28,707 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:23:28,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:28,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:28,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,711 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:28,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:28,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:28,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,715 INFO L85 PathProgramCache]: Analyzing trace with hash 131725895, now seen corresponding path program 16 times [2025-04-26 16:23:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192123641] [2025-04-26 16:23:28,716 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,717 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 16:23:28,718 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:28,718 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:28,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:28,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:28,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:28,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,721 INFO L85 PathProgramCache]: Analyzing trace with hash -102560626, now seen corresponding path program 14 times [2025-04-26 16:23:28,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602890733] [2025-04-26 16:23:28,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:28,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-26 16:23:28,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:23:28,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:28,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,727 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:23:28,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:23:28,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:29,135 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:29,136 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:29,136 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:29,136 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:29,136 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:29,136 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,136 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:29,136 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:29,136 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration23_Lasso [2025-04-26 16:23:29,136 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:29,136 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:29,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:29,344 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:29,344 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:29,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,346 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:29,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-04-26 16:23:29,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:29,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:29,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:29,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:29,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:29,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:29,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:29,361 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:29,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2025-04-26 16:23:29,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,369 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:29,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-04-26 16:23:29,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:29,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:29,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:29,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:29,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:29,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:29,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:29,384 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:29,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:29,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,392 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:29,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-04-26 16:23:29,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:29,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:29,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:29,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:29,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:29,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:29,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:29,407 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:29,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:29,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,434 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:29,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-04-26 16:23:29,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:29,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:29,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:29,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:29,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:29,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:29,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:29,448 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:29,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:29,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,456 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:29,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-04-26 16:23:29,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:29,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:29,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:29,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:29,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:29,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:29,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:29,474 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:29,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-04-26 16:23:29,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,481 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:29,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-04-26 16:23:29,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:29,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:29,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:29,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:29,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:29,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:29,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:29,496 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:29,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:29,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,502 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:29,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-04-26 16:23:29,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:29,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:29,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:29,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:29,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:29,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:29,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:29,523 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:29,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2025-04-26 16:23:29,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,531 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:29,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-04-26 16:23:29,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:29,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:29,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:29,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:29,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:29,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:29,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:29,545 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:29,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-04-26 16:23:29,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,556 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:29,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-04-26 16:23:29,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:29,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:29,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:29,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:29,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:29,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:29,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:29,577 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:29,581 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:23:29,581 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:29,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,582 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:29,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-04-26 16:23:29,584 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:29,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-04-26 16:23:29,600 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:29,600 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:29,600 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 16:23:29,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:29,609 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-04-26 16:23:29,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:29,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:29,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:29,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:29,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:29,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:29,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:29,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:29,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:29,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:29,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:29,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:29,654 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:29,654 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40436 states and 153182 transitions. cyclomatic complexity: 115967 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:30,173 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40436 states and 153182 transitions. cyclomatic complexity: 115967. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 59839 states and 218370 transitions. Complement of second has 5 states. [2025-04-26 16:23:30,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-26 16:23:30,173 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 17 letters. Loop has 5 letters. [2025-04-26 16:23:30,174 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:30,174 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:30,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:30,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:30,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:30,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:30,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:30,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:30,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:30,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:30,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:30,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:30,236 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:30,236 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40436 states and 153182 transitions. cyclomatic complexity: 115967 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:30,818 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40436 states and 153182 transitions. cyclomatic complexity: 115967. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 72682 states and 270301 transitions. Complement of second has 7 states. [2025-04-26 16:23:30,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-04-26 16:23:30,819 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 17 letters. Loop has 5 letters. [2025-04-26 16:23:30,819 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:30,819 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:30,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:30,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:30,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:30,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:30,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:30,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:30,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:30,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:30,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:30,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:30,879 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:30,879 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40436 states and 153182 transitions. cyclomatic complexity: 115967 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:31,386 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40436 states and 153182 transitions. cyclomatic complexity: 115967. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 87981 states and 324537 transitions. Complement of second has 6 states. [2025-04-26 16:23:31,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-04-26 16:23:31,387 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 17 letters. Loop has 5 letters. [2025-04-26 16:23:31,387 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,387 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 22 letters. Loop has 5 letters. [2025-04-26 16:23:31,387 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,388 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 17 letters. Loop has 10 letters. [2025-04-26 16:23:31,388 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87981 states and 324537 transitions. [2025-04-26 16:23:32,446 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 252 [2025-04-26 16:23:32,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87981 states to 63341 states and 223770 transitions. [2025-04-26 16:23:32,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6152 [2025-04-26 16:23:32,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6339 [2025-04-26 16:23:32,903 INFO L74 IsDeterministic]: Start isDeterministic. Operand 63341 states and 223770 transitions. [2025-04-26 16:23:32,903 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:32,903 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63341 states and 223770 transitions. [2025-04-26 16:23:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63341 states and 223770 transitions. [2025-04-26 16:23:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63341 to 37096. [2025-04-26 16:23:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37096 states, 37096 states have (on average 3.7888990726762994) internal successors, (in total 140553), 37095 states have internal predecessors, (140553), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37096 states to 37096 states and 140553 transitions. [2025-04-26 16:23:34,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37096 states and 140553 transitions. [2025-04-26 16:23:34,040 INFO L438 stractBuchiCegarLoop]: Abstraction has 37096 states and 140553 transitions. [2025-04-26 16:23:34,040 INFO L340 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-04-26 16:23:34,040 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37096 states and 140553 transitions. [2025-04-26 16:23:34,215 INFO L131 ngComponentsAnalysis]: Automaton has 77 accepting balls. 154 [2025-04-26 16:23:34,216 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:34,216 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:34,216 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:34,216 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:34,217 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L96-->L76: 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]" "[113] L76-->L77: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[115] L77-->L77-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[116] L77-1-->L82: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[117] L82-->L87: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[118] L87-->L76: Formula: (or (and (<= v_k_3 0) (not v_g_2)) (and v_g_2 (< 0 v_k_3))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" "[113] L76-->L77: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[115] L77-->L77-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[116] L77-1-->L82: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" [2025-04-26 16:23:34,217 INFO L754 eck$LassoCheckResult]: Loop: "[100] L41-->L33: 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[]" "[102] L33-->L41: Formula: (and (= (+ v_q3_front_15 1) v_q3_front_14) (= (+ v_r_14 v_l_7) v_r_13) (< v_q3_front_15 v_q3_back_6) (= v_l_7 (select v_q3_5 v_q3_front_15))) InVars {q3_front=v_q3_front_15, q3_back=v_q3_back_6, q3=v_q3_5, r=v_r_14} OutVars{q3_front=v_q3_front_14, q3_back=v_q3_back_6, l=v_l_7, q3=v_q3_5, r=v_r_13} AuxVars[] AssignedVars[l, q3_front, r]" [2025-04-26 16:23:34,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:34,217 INFO L85 PathProgramCache]: Analyzing trace with hash 525177650, now seen corresponding path program 1 times [2025-04-26 16:23:34,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:34,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456662084] [2025-04-26 16:23:34,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:34,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:34,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:34,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:34,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:34,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:23:34,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:34,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456662084] [2025-04-26 16:23:34,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456662084] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:34,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:34,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:23:34,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960132920] [2025-04-26 16:23:34,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:34,262 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:23:34,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:34,262 INFO L85 PathProgramCache]: Analyzing trace with hash 4163, now seen corresponding path program 3 times [2025-04-26 16:23:34,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:34,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252800308] [2025-04-26 16:23:34,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:34,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:34,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:34,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:34,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:34,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:34,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:34,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:34,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:34,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:34,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:34,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:34,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:34,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:23:34,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:23:34,287 INFO L87 Difference]: Start difference. First operand 37096 states and 140553 transitions. cyclomatic complexity: 106546 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:35,034 INFO L93 Difference]: Finished difference Result 86320 states and 313189 transitions. [2025-04-26 16:23:35,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86320 states and 313189 transitions. [2025-04-26 16:23:36,055 INFO L131 ngComponentsAnalysis]: Automaton has 231 accepting balls. 462 [2025-04-26 16:23:36,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86320 states to 73979 states and 266671 transitions. [2025-04-26 16:23:36,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10178 [2025-04-26 16:23:36,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11016 [2025-04-26 16:23:36,756 INFO L74 IsDeterministic]: Start isDeterministic. Operand 73979 states and 266671 transitions. [2025-04-26 16:23:36,756 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:36,756 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73979 states and 266671 transitions. [2025-04-26 16:23:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73979 states and 266671 transitions. [2025-04-26 16:23:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73979 to 58137. [2025-04-26 16:23:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58137 states, 58137 states have (on average 3.669780002408105) internal successors, (in total 213350), 58136 states have internal predecessors, (213350), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58137 states to 58137 states and 213350 transitions. [2025-04-26 16:23:38,247 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58137 states and 213350 transitions. [2025-04-26 16:23:38,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:23:38,248 INFO L438 stractBuchiCegarLoop]: Abstraction has 58137 states and 213350 transitions. [2025-04-26 16:23:38,248 INFO L340 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-04-26 16:23:38,248 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58137 states and 213350 transitions. [2025-04-26 16:23:38,576 INFO L131 ngComponentsAnalysis]: Automaton has 87 accepting balls. 174 [2025-04-26 16:23:38,576 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:38,576 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:38,577 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:38,577 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:38,577 INFO L752 eck$LassoCheckResult]: Stem: "[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[121] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[100] L41-->L33: 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[]" "[103] L33-->L41: Formula: (and (= v_i_10 (+ v_i_11 1)) (= (+ 1 v_q1_back_18) v_q1_back_17) (= (select v_q1_6 v_q1_back_18) 2)) InVars {q1=v_q1_6, i=v_i_11, q1_back=v_q1_back_18} OutVars{q1=v_q1_6, i=v_i_10, q1_back=v_q1_back_17} AuxVars[] AssignedVars[i, q1_back]" "[124] L95-1-->L58: 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]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[110] L64-->L69: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[127] L96-->L76: 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]" "[113] L76-->L77: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[111] L69-->L58: Formula: (or (and (not v_f_2) (<= v_j_4 0)) (and (< 0 v_j_4) v_f_2)) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L58-->L59: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_21) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_21} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_21, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[109] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[115] L77-->L77-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[116] L77-1-->L82: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[117] L82-->L87: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[118] L87-->L76: Formula: (or (and (<= v_k_3 0) (not v_g_2)) (and v_g_2 (< 0 v_k_3))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" "[113] L76-->L77: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[115] L77-->L77-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[116] L77-1-->L82: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" [2025-04-26 16:23:38,577 INFO L754 eck$LassoCheckResult]: Loop: "[100] L41-->L33: 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[]" "[102] L33-->L41: Formula: (and (= (+ v_q3_front_15 1) v_q3_front_14) (= (+ v_r_14 v_l_7) v_r_13) (< v_q3_front_15 v_q3_back_6) (= v_l_7 (select v_q3_5 v_q3_front_15))) InVars {q3_front=v_q3_front_15, q3_back=v_q3_back_6, q3=v_q3_5, r=v_r_14} OutVars{q3_front=v_q3_front_14, q3_back=v_q3_back_6, l=v_l_7, q3=v_q3_5, r=v_r_13} AuxVars[] AssignedVars[l, q3_front, r]" [2025-04-26 16:23:38,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash -892838909, now seen corresponding path program 1 times [2025-04-26 16:23:38,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612895670] [2025-04-26 16:23:38,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:38,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:38,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:38,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:38,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:38,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash 4163, now seen corresponding path program 4 times [2025-04-26 16:23:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362676604] [2025-04-26 16:23:38,600 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,605 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 16:23:38,606 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:38,606 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:38,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:38,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:38,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash 975270853, now seen corresponding path program 1 times [2025-04-26 16:23:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546448349] [2025-04-26 16:23:38,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:38,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:23:38,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:23:38,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:23:38,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:23:38,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:39,268 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:39,268 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:39,268 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:39,268 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:39,268 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:39,268 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,268 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:39,268 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:39,268 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_petrified1_Iteration25_Lasso [2025-04-26 16:23:39,269 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:39,269 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:39,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,653 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:39,653 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:39,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,656 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-04-26 16:23:39,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,674 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:39,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2025-04-26 16:23:39,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,681 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-04-26 16:23:39,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,705 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:39,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2025-04-26 16:23:39,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,713 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-04-26 16:23:39,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,729 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:39,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2025-04-26 16:23:39,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,736 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-04-26 16:23:39,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,756 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:39,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-04-26 16:23:39,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,764 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-04-26 16:23:39,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:39,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:39,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:39,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:39,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:39,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:39,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:39,781 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:39,788 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:23:39,789 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:39,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:39,790 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:39,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-04-26 16:23:39,792 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:39,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-04-26 16:23:39,809 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:39,809 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:39,809 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q3_back, q3_front) = 1*q3_back - 1*q3_front Supporting invariants [] [2025-04-26 16:23:39,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:39,826 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-04-26 16:23:39,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:39,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:39,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:39,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:39,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:39,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:39,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:39,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:39,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:39,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:39,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:39,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:39,868 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:23:39,869 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58137 states and 213350 transitions. cyclomatic complexity: 160647 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:40,620 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58137 states and 213350 transitions. cyclomatic complexity: 160647. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 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 108241 states and 400973 transitions. Complement of second has 5 states. [2025-04-26 16:23:40,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-26 16:23:40,621 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 24 letters. Loop has 2 letters. [2025-04-26 16:23:40,621 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:40,621 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:40,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:40,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:40,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:40,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:40,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:40,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:40,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:40,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:40,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:40,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:40,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:40,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:40,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:40,660 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:23:40,660 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58137 states and 213350 transitions. cyclomatic complexity: 160647 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:41,323 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58137 states and 213350 transitions. cyclomatic complexity: 160647. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 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 108241 states and 400973 transitions. Complement of second has 5 states. [2025-04-26 16:23:41,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-26 16:23:41,324 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 24 letters. Loop has 2 letters. [2025-04-26 16:23:41,324 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:41,324 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:41,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:41,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:23:41,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:23:41,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:41,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:41,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:41,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:41,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:41,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:41,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:41,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:41,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:41,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:41,363 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:23:41,363 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58137 states and 213350 transitions. cyclomatic complexity: 160647 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:42,426 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58137 states and 213350 transitions. cyclomatic complexity: 160647. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 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 137720 states and 510939 transitions. Complement of second has 5 states. [2025-04-26 16:23:42,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-26 16:23:42,427 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 24 letters. Loop has 2 letters. [2025-04-26 16:23:42,427 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:42,427 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 26 letters. Loop has 2 letters. [2025-04-26 16:23:42,427 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:42,427 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 24 letters. Loop has 4 letters. [2025-04-26 16:23:42,427 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:42,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137720 states and 510939 transitions. [2025-04-26 16:23:44,119 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:44,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137720 states to 0 states and 0 transitions. [2025-04-26 16:23:44,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:44,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:44,119 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:44,119 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:44,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:44,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:44,119 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:44,119 INFO L340 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-04-26 16:23:44,119 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:44,119 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:44,119 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:44,125 INFO L201 PluginConnector]: Adding new model ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:44 BoogieIcfgContainer [2025-04-26 16:23:44,125 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:44,125 INFO L158 Benchmark]: Toolchain (without parser) took 49945.77ms. Allocated memory was 155.2MB in the beginning and 6.7GB in the end (delta: 6.6GB). Free memory was 82.7MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-04-26 16:23:44,125 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:44,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.56ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 81.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:44,126 INFO L158 Benchmark]: Boogie Preprocessor took 18.99ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 79.8MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:44,126 INFO L158 Benchmark]: RCFGBuilder took 209.61ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 68.0MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:44,126 INFO L158 Benchmark]: BuchiAutomizer took 49674.52ms. Allocated memory was 155.2MB in the beginning and 6.7GB in the end (delta: 6.6GB). Free memory was 67.8MB in the beginning and 3.7GB in the end (delta: -3.7GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-04-26 16:23:44,129 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.17ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.56ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 81.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.99ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 79.8MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 209.61ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 68.0MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 49674.52ms. Allocated memory was 155.2MB in the beginning and 6.7GB in the end (delta: 6.6GB). Free memory was 67.8MB in the beginning and 3.7GB in the end (delta: -3.7GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 49.5s and 26 iterations. TraceHistogramMax:4. Analysis of lassos took 15.5s. Construction of modules took 0.5s. Büchi inclusion checks took 15.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 23. Automata minimization 8.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 201629 StatesRemovedByMinimization, 24 NontrivialMinimizations. Non-live state removal took 12.3s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [13, 1, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1148 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1121 mSDsluCounter, 1077 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 468 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 609 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU2 SILI0 SILT0 lasso18 LassoPreprocessingBenchmarks: Lassos: inital120 mio100 ax100 hnf100 lsp75 ukn89 mio100 lsp54 div100 bol107 ite100 ukn100 eq192 hnf89 smp100 dnf158 smp82 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 4 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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 25 terminating modules (7 trivial, 14 deterministic, 4 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function q3_back + -1 * q3_front and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 4 locations. One nondeterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One nondeterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One nondeterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One nondeterministic module has affine ranking function q3_back + -1 * q3_front and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:44,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:44,343 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...